In This Issue

Crosscutting Areas

On Information Distortions in Online Ratings

Pages:597–610

Published Online:February 2, 2018

https://doi.org/10.1287/opre.2017.1676

Technical Note—Analysis of Scrip Systems: On an Open Question in Johnson et al. (2014)

Pages:611–619

Published Online:March 16, 2018

https://doi.org/10.1287/opre.2017.1689

Convergence of the Core in Assignment Markets

Pages:620–636

Published Online:June 6, 2018

https://doi.org/10.1287/opre.2017.1691

Budget Feasible Procurement Auctions

Pages:637–652

Published Online:May 15, 2018

https://doi.org/10.1287/opre.2017.1693

Cost-per-Impression Pricing for Display Advertising

Pages:653–672

Published Online:May 24, 2018

https://doi.org/10.1287/opre.2017.1697

Optimal M-Switch Surveillance Policies for Liver Cancer in a Hepatitis C–Infected Population

Pages:673–696

Published Online:May 22, 2018

https://doi.org/10.1287/opre.2017.1706

Data Uncertainty in Markov Chains: Application to Cost-Effectiveness Analyses of Medical Innovations

Pages:697–715

Published Online:February 28, 2018

https://doi.org/10.1287/opre.2017.1685

Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster

Pages:716–732

Published Online:May 23, 2018

https://doi.org/10.1287/opre.2017.1695

Contextual Areas

Technical Note—A Robust Perspective on Transaction Costs in Portfolio Optimization

Pages:733–739

Published Online:May 22, 2018

https://doi.org/10.1287/opre.2017.1699

Technical Note—Multiproduct Inventory Management Under Customer Substitution and Capacity Restrictions

Pages:740–747

Published Online:May 11, 2018

https://doi.org/10.1287/opre.2017.1690

Technical Note—An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model

Pages:748–760

Published Online:May 11, 2018

https://doi.org/10.1287/opre.2017.1692

Service Pricing with Loss-Averse Customers

Pages:761–777

Published Online:May 9, 2018

https://doi.org/10.1287/opre.2017.1702

New Lower Bound and Exact Method for the Continuous Berth Allocation Problem

Pages:778–798

Published Online:March 16, 2018

https://doi.org/10.1287/opre.2017.1687

Methods

When to Abandon a Research Project and Search for a New One

Pages:799–813

Published Online:May 23, 2018

https://doi.org/10.1287/opre.2017.1701

Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information

Pages:814–833

Published Online:May 9, 2018

https://doi.org/10.1287/opre.2017.1688

Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations

Pages:834–848

Published Online:May 23, 2018

https://doi.org/10.1287/opre.2017.1696

Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls

Pages:849–869

Published Online:May 25, 2018

https://doi.org/10.1287/opre.2017.1698

Inverse Optimization with Noisy Data

Pages:870–892

Published Online:May 15, 2018

https://doi.org/10.1287/opre.2017.1705

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.