Volume 68 · Issue 6

November 202019 articles

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios

Will Ma · David Simchi-Levi

Discuss this article →

November 2020pp. 1787-1803DOI: 10.1287/opre.2019.1957 ↗

Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization

Jinlong Lei · Uday V. Shanbhag

Discuss this article →

November 2020pp. 1742-1766DOI: 10.1287/opre.2019.1946 ↗

Diffusion in Random Networks: Impact of Degree Distribution

Vahideh Manshadi · Sidhant Misra · Scott Rodilitz

Discuss this article →

November 2020pp. 1722-1741DOI: 10.1287/opre.2019.1945 ↗

Editorial Board

Authors not recorded

Discuss this article →

November 2020pp. C2-C3DOI: 10.1287/opre.2020.eb.v6806 ↗

Efficient Solution of Maximum-Entropy Sampling Problems

Kurt M. Anstreicher

Discuss this article →

November 2020pp. 1826-1835DOI: 10.1287/opre.2019.1962 ↗

In This Issue

Authors not recorded

Discuss this article →

November 2020pp. ii-ivDOI: 10.1287/opre.2020.2063 ↗

Information and Memory in Dynamic Resource Allocation

Kuang Xu · Yuan Zhong

Discuss this article →

November 2020pp. 1698-1715DOI: 10.1287/opre.2019.1940 ↗

Input Efficiency Measures: A Generalized, Encompassing Formulation

Walter Briec · Laurent Cavaignac · Kristiaan Kerstens

Discuss this article →

November 2020pp. 1836-1849DOI: 10.1287/opre.2019.1963 ↗

Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling

Yijie Peng · Michael C. Fu · Bernd Heidergott · Henry Lam

Discuss this article →

November 2020pp. 1896-1912DOI: 10.1287/opre.2019.1978 ↗

Network-Based Approximate Linear Programming for Discrete Optimization

Selvaprabu Nadarajah · Andre A. Cire

Discuss this article →

November 2020pp. 1767-1786DOI: 10.1287/opre.2019.1953 ↗

On the Consistent Path Problem

Leonardo Lozano · David Bergman · J. Cole Smith

Discuss this article →

November 2020pp. 1913-1931DOI: 10.1287/opre.2020.1979 ↗

Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls

Yuqian Xu · Lingjiong Zhu · Michael Pinedo

Discuss this article →

November 2020pp. 1804-1825DOI: 10.1287/opre.2019.1960 ↗

Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds

Daniel R. Jiang · Lina Al-Kanj · Warren B. Powell

Discuss this article →

November 2020pp. 1678-1697DOI: 10.1287/opre.2019.1939 ↗

Parallel Bayesian Global Optimization of Expensive Functions

Jialei Wang · Scott C. Clark · Eric Liu · Peter I. Frazier

Discuss this article →

November 2020pp. 1850-1865DOI: 10.1287/opre.2019.1966 ↗

Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates

Jinting Wang · Zhongbin Wang · Yunan Liu

Discuss this article →

November 2020pp. 1648-1667DOI: 10.1287/opre.2019.1933 ↗

Simple Bayesian Algorithms for Best-Arm Identification

Daniel Russo

Discuss this article →

November 2020pp. 1625-1647DOI: 10.1287/opre.2019.1911 ↗

Technical Note—On the Optimality of Reflection Control

Jiankui Yang · David D. Yao · Heng-Qing Ye

Discuss this article →

November 2020pp. 1668-1677DOI: 10.1287/opre.2019.1935 ↗

Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization

Thomas Kleinert · Martine Labbé · Fr¨ank Plein · Martin Schmidt

Discuss this article →

November 2020pp. 1716-1721DOI: 10.1287/opre.2019.1944 ↗

Why Is Maximum Clique Often Easy in Practice?

Jose L. Walteros · Austin Buchanan

Discuss this article →

November 2020pp. 1866-1895DOI: 10.1287/opre.2019.1970 ↗