In This Issue

Contextual Areas

Technical Note—A Permutation-Dependent Separability Approach for Capacitated Two-Echelon Inventory Systems

Pages:1953–1968

Published Online:November 19, 2021

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

Capacity Games with Supply Function Competition

Pages:1969–1983

Published Online:February 2, 2022

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

Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions

Pages:1984–1995

Published Online:February 8, 2022

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

Technical Note—Data-Driven Newsvendor Problem: Performance of the Sample Average Approximation

Pages:1996–2012

Published Online:June 14, 2022

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

Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees

Pages:2013–2031

Published Online:March 2, 2022

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

Vessel Service Planning in Seaports

Pages:2032–2053

Published Online:May 11, 2022

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

Optimal Dynamic Momentum Strategies

Pages:2054–2068

Published Online:February 17, 2022

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

Modeling the Risk in Mortality Projections

Pages:2069–2084

Published Online:February 15, 2022

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

Pricing of Debt and Equity in a Financial Network with Comonotonic Endowments

Pages:2085–2100

Published Online:March 16, 2022

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

Easy Cases of Deadlock Detection in Train Scheduling

Pages:2101–2118

Published Online:April 27, 2022

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

Optimizing Opinions with Stubborn Agents

Pages:2119–2137

Published Online:April 26, 2022

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

Online Resource Allocation with Personalized Learning

Pages:2138–2161

Published Online:May 10, 2022

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

Crosscutting Areas

Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays

Pages:2162–2184

Published Online:February 7, 2022

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

Multiproduct Pricing with Discrete Price Sets

Pages:2185–2193

Published Online:January 27, 2022

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

Technical Note—Online Hypergraph Matching with Delays

Pages:2194–2212

Published Online:April 22, 2022

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

Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services

Pages:2213–2225

Published Online:May 17, 2022

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

Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources

Pages:2226–2236

Published Online:March 25, 2022

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

Network Revenue Management Under a Spiked Multinomial Logit Choice Model

Pages:2237–2253

Published Online:March 30, 2022

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

Technical Note—Revenue Volatility Under Uncertain Network Effects

Pages:2254–2263

Published Online:June 15, 2022

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

Persuasion in Networks: Public Signals and Cores

Pages:2264–2298

Published Online:April 8, 2022

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

Dynamic Double Auctions: Toward First Best

Pages:2299–2317

Published Online:April 8, 2022

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

Seeding with Costly Network Information

Pages:2318–2348

Published Online:May 17, 2022

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

Dynamic Stochastic Matching Under Limited Time

Pages:2349–2383

Published Online:June 6, 2022

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

Methods

Learning Markov Models Via Low-Rank Optimization

Pages:2384–2398

Published Online:November 23, 2021

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

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem

Pages:2399–2420

Published Online:September 16, 2021

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

Smart Policies for Multisource Inventory Systems and General Tandem Queues with Order Tracking and Expediting

Pages:2421–2438

Published Online:July 21, 2021

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

Risk-Averse Stochastic Programming: Time Consistency and Optimal Stopping

Pages:2439–2455

Published Online:June 2, 2021

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

Stability of Parallel Server Systems

Pages:2456–2476

Published Online:August 16, 2021

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

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation

Pages:2477–2495

Published Online:August 16, 2021

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

Exploiting Random Lead Times for Significant Inventory Cost Savings

Pages:2496–2516

Published Online:October 4, 2021

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

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency

Pages:2517–2537

Published Online:October 29, 2021

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

Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming

Pages:2538–2562

Published Online:November 24, 2021

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

Open Access
Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization

Pages:2563–2578

Published Online:December 2, 2021

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

A Fluid-Diffusion-Hybrid Limiting Approximation for Priority Systems with Fast and Slow Customers

Pages:2579–2596

Published Online:November 15, 2021

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C3

Published Online:August 15, 2022

https://doi.org/10.1287/opre.2022.eb.v7004

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.