Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Absorbing Games with Compact Action Spaces

Pages:257–262

Published Online:April 10, 2009

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

Preview Abstract
Time Average Replicator and Best-Reply Dynamics

Pages:263–269

Published Online:April 24, 2009

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

Preview Abstract
Online Primal-Dual Algorithms for Covering and Packing

Pages:270–286

Published Online:April 17, 2009

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

Preview Abstract
Partially Observed Markov Decision Process Multiarmed Bandits—Structural Results

Pages:287–302

Published Online:April 10, 2009

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

Preview Abstract
Penalty and Smoothing Methods for Convex Semi-Infinite Programming

Pages:303–319

Published Online:April 3, 2009

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

Preview Abstract
Credit Risk Models with Incomplete Information

Pages:320–332

Published Online:April 17, 2009

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

Preview Abstract
Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems

Pages:333–350

Published Online:April 17, 2009

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

Preview Abstract
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs

Pages:351–362

Published Online:April 10, 2009

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

Preview Abstract
Queue-and-Idleness-Ratio Controls in Many-Server Service Systems

Pages:363–396

Published Online:April 3, 2009

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

Preview Abstract
An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand

Pages:397–416

Published Online:April 17, 2009

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

Preview Abstract
Tight Bounds for Permutation Flow Shop Scheduling

Pages:417–427

Published Online:April 3, 2009

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

Preview Abstract
An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time

Pages:428–444

Published Online:May 1, 2009

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

Preview Abstract
Maximum Entropy Principle with General Deviation Measures

Pages:445–467

Published Online:April 27, 2009

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

Preview Abstract
Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem

Pages:468–480

Published Online:April 17, 2009

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

Preview Abstract
Online Scheduling with Bounded Migration

Pages:481–498

Published Online:April 17, 2009

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

Preview Abstract
Earliest Arrival Flows with Multiple Sources

Pages:499–512

Published Online:April 10, 2009

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

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