Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity

Pages:1–22

Published Online:February 1, 2000

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

Preview Abstract
The Maxmin of Recursive Games with Incomplete Information on one Side

Pages:23–35

Published Online:February 1, 2000

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

Preview Abstract
The Quickest Transshipment Problem

Pages:36–62

Published Online:February 1, 2000

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

Preview Abstract
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

Pages:63–75

Published Online:February 1, 2000

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

Preview Abstract
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow

Pages:76–104

Published Online:February 1, 2000

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

Preview Abstract
The Random Weighted Interval Packing Problem: The Intermediate Density Case

Pages:105–117

Published Online:February 1, 2000

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

Preview Abstract
The Complexity of Optimal Small Policies

Pages:118–129

Published Online:February 1, 2000

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

Preview Abstract
Constrained Discounted Markov Decision Processes and Hamiltonian Cycles

Pages:130–140

Published Online:February 1, 2000

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

Preview Abstract
Optimal Preventive Replacement Under Minimal Repair and Random Repair Cost

Pages:141–156

Published Online:February 1, 2000

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

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