Research Article

Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming

Pages:1–20

Published Online:January 9, 2012

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

Intersection Cuts with Infinite Split Rank

Pages:21–40

Published Online:January 9, 2012

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

Queues with Many Servers and Impatient Customers

Pages:41–65

Published Online:January 13, 2012

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

Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming

Pages:66–94

Published Online:January 13, 2012

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

A Distributional Interpretation of Robust Optimization

Pages:95–110

Published Online:January 13, 2012

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

Optimal Symmetric Rendezvous Search on Three Locations

Pages:111–122

Published Online:January 13, 2012

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

Strategy for Quickest Second Meeting of Two Agents in Two Locations

Pages:123–128

Published Online:January 13, 2012

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

Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes

Pages:129–153

Published Online:January 9, 2012

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

The Value of Repeated Games with an Informed Controller

Pages:154–179

Published Online:January 9, 2012

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

A Topological Approach to Quitting Games

Pages:180–195

Published Online:January 9, 2012

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

A Note on the Number of α-Pivotal Players

Pages:196–200

Published Online:January 9, 2012

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

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.