Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Articles

Belief-Free Communication Equilibria in Repeated Games

Pages:617–637

Published Online:May 6, 2013

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

Preview Abstract
From Local to Global Stability in Stochastic Processing Networks Through Quadratic Lyapunov Functions

Pages:638–664

Published Online:March 13, 2013

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

Preview Abstract
Exploiting Known Structures to Approximate Normal Cones

Pages:665–681

Published Online:March 13, 2013

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

Preview Abstract
Optimal Dynamic Auctions and Simple Index Rules

Pages:682–697

Published Online:May 6, 2013

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

Preview Abstract
Optimal Sampling of Overflow Paths in Jackson Networks

Pages:698–719

Published Online:March 29, 2013

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

Preview Abstract
An Approximation Algorithm for the Bipartite Traveling Tournament Problem

Pages:720–728

Published Online:May 6, 2013

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

Preview Abstract
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints

Pages:729–739

Published Online:March 29, 2013

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

Preview Abstract
Nonlinear Augmented Lagrangian and Duality Theory

Pages:740–760

Published Online:March 29, 2013

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

Preview Abstract
Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy

Pages:761–824

Published Online:May 6, 2013

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

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