Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities

Pages:1–25

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0352

Preview Abstract
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements

Pages:26–44

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0342

Preview Abstract
Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic

Pages:45–56

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0353

Preview Abstract
Strategic Manipulation of Empirical Tests

Pages:57–70

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0347

Preview Abstract
Markov Chains and Optimality of the Hamiltonian Cycle

Pages:71–82

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0351

Preview Abstract
A Conic Duality Frank–Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization

Pages:83–91

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0345

Preview Abstract
Online Scheduling with Known Arrival Times

Pages:92–102

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0346

Preview Abstract
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand

Pages:103–123

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0355

Preview Abstract
Local Duality of Nonlinear Semidefinite Programming

Pages:124–141

Published Online:August 12, 2008

https://doi.org/10.1287/moor.1080.0315

Preview Abstract
Multiserver Loss Systems with Subscribers

Pages:142–179

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0350

Preview Abstract
Unconstrained Convex Minimization in Relative Scale

Pages:180–193

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0348

Preview Abstract
Network Formulations of Mixed-Integer Programs

Pages:194–209

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0354

Preview Abstract
An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem

Pages:210–237

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0360

Preview Abstract
Monotone Covering Problems with an Additional Covering Constraint

Pages:238–248

Published Online:January 27, 2009

https://doi.org/10.1287/moor.1080.0356

Preview Abstract
Comment on “Investment Timing Under Incomplete Information”

Pages:249–254

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0349

Preview Abstract
Investment Timing Under Incomplete Information: Erratum

Pages:255–256

Published Online:February 1, 2009

https://doi.org/10.1287/moor.1080.0357

Preview Abstract
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree