Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Strategyproof Approximation of the Minimax on Networks

Pages:513–526

Published Online:August 1, 2010

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

Preview Abstract
Directional Derivatives of Oblique Reflection Maps

Pages:527–558

Published Online:August 4, 2010

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

Preview Abstract
Optimal Investment for Worst-Case Crash Scenarios: A Martingale Approach

Pages:559–579

Published Online:August 4, 2010

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

Preview Abstract
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion

Pages:580–602

Published Online:April 30, 2010

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

Preview Abstract
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs

Pages:603–623

Published Online:August 4, 2010

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

Preview Abstract
Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor

Pages:624–640

Published Online:August 4, 2010

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

Preview Abstract
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning

Pages:641–654

Published Online:August 4, 2010

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

Preview Abstract
A Unified Approach to Box-Mengerian Hypergraphs

Pages:655–668

Published Online:August 4, 2010

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

Preview Abstract
Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes

Pages:669–703

Published Online:August 1, 2010

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

Preview Abstract
Maximal Lattice-Free Convex Sets in Linear Subspaces

Pages:704–720

Published Online:August 1, 2010

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

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