Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Robust Dynamic Programming

Pages:257–280

Published Online:May 1, 2005

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

Preview Abstract
Large Deviations with Diminishing Rates

Pages:281–310

Published Online:May 1, 2005

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

Preview Abstract
Ultramodular Functions

Pages:311–332

Published Online:May 1, 2005

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

Preview Abstract
Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications

Pages:333–353

Published Online:May 1, 2005

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

Preview Abstract
Sporadic and Continuous Clearing Policies for a Production/Inventory System Under an M/G Demand Process

Pages:354–368

Published Online:May 1, 2005

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

Preview Abstract
A Conic Programming Approach to Generalized Tchebycheff Inequalities

Pages:369–388

Published Online:May 1, 2005

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

Preview Abstract
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Pages:389–403

Published Online:May 1, 2005

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

Preview Abstract
Partially Ball Weakly Inf-Compact Saddle Functions

Pages:404–419

Published Online:May 1, 2005

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

Preview Abstract
Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime

Pages:420–440

Published Online:May 1, 2005

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

Preview Abstract
The Continuous Mixing Polyhedron

Pages:441–452

Published Online:May 1, 2005

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

Preview Abstract
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions

Pages:453–461

Published Online:May 1, 2005

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

Preview Abstract
On the Lipschitz Continuity of the Solution Map in Semidefinite Linear Complementarity Problems

Pages:462–471

Published Online:May 1, 2005

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

Preview Abstract
Investment Timing Under Incomplete Information

Pages:472–500

Published Online:May 1, 2005

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

Preview Abstract
A Sequential Entry Problem with Forced Exits

Pages:501–520

Published Online:May 1, 2005

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

Preview Abstract
On the Average Waiting Time for Regular Routing to Deterministic Queues

Pages:521–544

Published Online:May 1, 2005

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

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