Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Articles

The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited

Pages:253–275

Published Online:August 1, 2014

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

Preview Abstract
Cut-Generating Functions and S-Free Sets

Pages:276–391

Published Online:August 20, 2014

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

Preview Abstract
Inventory Management with Stochastic Lead Times

Pages:302–327

Published Online:August 4, 2014

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

Preview Abstract
Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions

Pages:328–349

Published Online:August 18, 2014

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

Preview Abstract
Forbidden Vertices

Pages:350–360

Published Online:August 4, 2014

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

Preview Abstract
Parameter Estimation: The Proper Way to Use Bayesian Posterior Processes with Brownian Noise

Pages:361–389

Published Online:August 21, 2014

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

Preview Abstract
A Fluid EOQ Model of Perishable Items with Intermittent High and Low Demand Rates

Pages:390–402

Published Online:August 28, 2014

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

Preview Abstract
Commutative Stochastic Games

Pages:403–428

Published Online:October 15, 2014

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

Preview Abstract
Equimeasurable Rearrangements with Capacities

Pages:429–445

Published Online:September 30, 2014

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

Preview Abstract
Facility Location with Matroid or Knapsack Constraints

Pages:446–459

Published Online:November 5, 2014

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

Preview Abstract
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market

Pages:460–473

Published Online:September 23, 2014

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

Preview Abstract
On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms

Pages:474–494

Published Online:September 29, 2014

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

Preview Abstract
K-Optimal Design via Semidefinite Programming and Entropy Optimization

Pages:495–512

Published Online:October 6, 2014

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

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