Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

On Polyhedral Approximations of the Second-Order Cone

Pages:193–205

Published Online:May 1, 2001

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

Preview Abstract
Conditioning of Convex Programs from a Primal-Dual Perspective

Pages:206–220

Published Online:May 1, 2001

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

Preview Abstract
An ϵ-Out-of-Kilter Method for Monotropic Programming

Pages:221–233

Published Online:May 1, 2001

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

Preview Abstract
On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping

Pages:234–247

Published Online:May 1, 2001

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

Preview Abstract
A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

Pages:248–264

Published Online:May 1, 2001

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

Preview Abstract
Quitting Games

Pages:265–285

Published Online:May 1, 2001

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

Preview Abstract
Absorbing Games with a Signalling Structure

Pages:286–303

Published Online:May 1, 2001

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

Preview Abstract
Cutting Planes and the Elementary Closure in Fixed Dimension

Pages:304–312

Published Online:May 1, 2001

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

Preview Abstract
Bounds on the Performance of a Greedy Algorithm for Probabilities

Pages:313–323

Published Online:May 1, 2001

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

Preview Abstract
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

Pages:324–338

Published Online:May 1, 2001

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

Preview Abstract
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Pages:339–357

Published Online:May 1, 2001

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

Preview Abstract
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times

Pages:358–374

Published Online:May 1, 2001

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

Preview Abstract
Computing Densities for Markov Chains via Simulation

Pages:375–400

Published Online:May 1, 2001

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

Preview Abstract
Discounted Stochastic Fluid Programs

Pages:401–420

Published Online:May 1, 2001

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

Preview Abstract
Random LSC Functions: An Ergodic Theorem

Pages:421–445

Published Online:May 1, 2001

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

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