Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Front Matter

Free Access
In Memoriam

Pages:i–ii

Published Online:May 1, 2012

https://doi.org/10.1287/moor.37.2.i

Preview Abstract

Research Article

On Large Delays in Multi-Server Queues with Heavy Tails

Pages:201–218

Published Online:March 20, 2012

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

Preview Abstract
Asymmetric First-Price Auctions—A Dynamical-Systems Approach

Pages:219–243

Published Online:March 20, 2012

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

Preview Abstract
Optimal Lower Bounds for Anonymous Scheduling Mechanisms

Pages:244–258

Published Online:May 1, 2012

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

Preview Abstract
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems

Pages:259–287

Published Online:March 20, 2012

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

Preview Abstract
Distributionally Robust Markov Decision Processes

Pages:288–300

Published Online:May 1, 2012

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

Preview Abstract
Asymptotic Irrelevance of Initial Conditions for Skorohod Reflection Mapping on the Nonnegative Orthant

Pages:301–312

Published Online:March 20, 2012

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

Preview Abstract
A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice

Pages:313–345

Published Online:March 20, 2012

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

Preview Abstract
Unique Minimal Liftings for Simplicial Polytopes

Pages:346–355

Published Online:March 20, 2012

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

Preview Abstract
On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings

Pages:356–371

Published Online:February 2, 2012

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

Preview Abstract
On the Rank of Disjunctive Cuts

Pages:372–378

Published Online:March 20, 2012

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

Preview Abstract
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

Pages:379–398

Published Online:December 22, 2011

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

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