Research Articles

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

Pages:693–717

Published Online:January 3, 2018

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

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank

Pages:718–725

Published Online:January 17, 2018

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

Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings

Pages:726–753

Published Online:February 2, 2018

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

Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation

Pages:754–762

Published Online:February 2, 2018

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

Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs

Pages:763–780

Published Online:February 2, 2018

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

Multiple Exchange Property for M-Concave Functions and Valuated Matroids

Pages:781–788

Published Online:January 17, 2018

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

Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms

Pages:789–812

Published Online:February 5, 2018

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

Liquidity, Risk Measures, and Concentration of Measure

Pages:813–837

Published Online:February 12, 2018

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

Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime

Pages:838–866

Published Online:February 12, 2018

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

Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics

Pages:867–886

Published Online:February 5, 2018

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

Chebyshev Inequalities for Products of Random Variables

Pages:887–918

Published Online:February 16, 2018

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

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods

Pages:919–948

Published Online:March 15, 2018

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

Achievable Performance of Blind Policies in Heavy Traffic

Pages:949–964

Published Online:March 8, 2018

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

Pathwise Dynamic Programming

Pages:965–995

Published Online:March 19, 2018

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

Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm

Pages:996–1024

Published Online:March 16, 2018

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

Characterization of the Optimal Risk-Sensitive Average Cost in Denumerable Markov Decision Chains

Pages:1025–1050

Published Online:March 16, 2018

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

Editorial Board

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.