Research Articles

Uniform Turnpike Theorems for Finite Markov Decision Processes

Pages:1145–1160

Published Online:September 14, 2018

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

A General Regularized Continuous Formulation for the Maximum Clique Problem

Pages:1161–1173

Published Online:March 19, 2019

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

Unique Tarski Fixed Points

Pages:1174–1191

Published Online:June 4, 2019

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

On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity

Pages:1192–1207

Published Online:August 12, 2019

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

Optimal Cutting Planes from the Group Relaxations

Pages:1208–1220

Published Online:June 19, 2019

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

Submodular Maximization Through the Lens of Linear Programming

Pages:1221–1244

Published Online:August 2, 2019

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

A Mean Field Competition

Pages:1245–1263

Published Online:June 27, 2019

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

Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications

Pages:1264–1285

Published Online:August 1, 2019

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

The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing

Pages:1286–1303

Published Online:September 10, 2019

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

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games

Pages:1304–1325

Published Online:May 31, 2019

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

Rationalizable Implementation of Correspondences

Pages:1326–1344

Published Online:May 7, 2019

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

Asymptotically Optimal Appointment Schedules

Pages:1345–1380

Published Online:August 6, 2019

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

Optimality Conditions for Minimizers at Infinity in Polynomial Programming

Pages:1381–1395

Published Online:June 19, 2019

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

Product-Mix Auctions and Tropical Geometry

Pages:1396–1411

Published Online:August 1, 2019

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

The Structure of the Infinite Models in Integer Programming

Pages:1412–1430

Published Online:July 19, 2019

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

On Submodular Search and Machine Scheduling

Pages:1431–1449

Published Online:August 1, 2019

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

Information Asymmetries in Common-Value Auctions with Discrete Signals

Pages:1450–1476

Published Online:July 18, 2019

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

Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets

Pages:1477–1493

Published Online:September 18, 2019

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

An Improved Analysis of Local Search for Max-Sum Diversification

Pages:1494–1509

Published Online:September 17, 2019

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

Editorial Board

Free Access
Editorial Board

Pages:c2–c2

Published Online:November 4, 2019

https://doi.org/10.1287/moor.2019.eb.v44n4

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.