In This Issue

Crosscutting Areas

Bayesian Social Learning from Consumer Reviews

Pages:1209–1221

Published Online:August 23, 2019

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

Planning Online Advertising Using Gini Indices

Pages:1222–1245

Published Online:August 23, 2019

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

Contextual Areas

Designing Response Supply Chain Against Bioattacks

Pages:1246–1268

Published Online:August 23, 2019

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

Dynamic Stable Supplier Coalitions and Invariance in Assembly Systems with Commodity Components

Pages:1269–1282

Published Online:June 19, 2019

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

Technical Note—Assortment Optimization with Small Consideration Sets

Pages:1283–1299

Published Online:July 5, 2019

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

Process Flexibility for Multiperiod Production Systems

Pages:1300–1320

Published Online:August 6, 2019

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

Technical Note—Stochastic Optimization with Decisions Truncated by Positively Dependent Random Variables

Pages:1321–1327

Published Online:June 19, 2019

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

Methods

Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets

Pages:1328–1344

Published Online:July 5, 2019

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

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

Pages:1345–1361

Published Online:June 27, 2019

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

Optimization-Based Calibration of Simulation Input Models

Pages:1362–1382

Published Online:July 31, 2019

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

Rare-Event Simulation for Distribution Networks

Pages:1383–1396

Published Online:September 4, 2019

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

Optimal Signaling Mechanisms in Unobservable Queues

Pages:1397–1416

Published Online:August 6, 2019

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

Empty-Car Routing in Ridesharing Systems

Pages:1437–1452

Published Online:August 6, 2019

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

MNL-Bandit: A Dynamic Learning Approach to Assortment Selection

Pages:1453–1485

Published Online:September 10, 2019

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

Bandits with Global Convex Constraints and Objective

Pages:1486–1502

Published Online:August 7, 2019

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

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.