Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Editorial Board

Free Access
Editorial Board

Pages:iii–iii

Published Online:May 7, 2025

https://doi.org/10.1287/moor.2025.eb.v50n2

Research Articles

An Approximation to the Invariant Measure of the Limiting Diffusion of G/Ph/n + GI Queues in the Halfin–Whitt Regime and Related Asymptotics

Pages:783–812

Published Online:March 29, 2024

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

Preview Abstract
Simple and Explicit Bounds for Multiserver Queues with 1/1−ρ Scaling

Pages:813–837

Published Online:April 2, 2024

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

Preview Abstract
Opinion Dynamics on Directed Complex Networks

Pages:838–870

Published Online:April 5, 2024

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

Preview Abstract
On Constrained Mixed-Integer DR-Submodular Minimization

Pages:871–909

Published Online:April 8, 2024

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

Preview Abstract
Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2

Pages:910–934

Published Online:April 9, 2024

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

Preview Abstract
Finite-Time High-Probability Bounds for Polyak–Ruppert Averaged Iterates of Linear Stochastic Approximation

Pages:935–964

Published Online:April 16, 2024

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

Preview Abstract
Robust-to-Dynamics Optimization

Pages:965–992

Published Online:April 16, 2024

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

Preview Abstract
Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization

Pages:993–1018

Published Online:April 16, 2024

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

Preview Abstract
Convexification of Bilinear Terms over Network Polytopes

Pages:1019–1041

Published Online:April 22, 2024

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

Preview Abstract
Equilibrium Portfolio Selection for Smooth Ambiguity Preferences

Pages:1042–1071

Published Online:April 24, 2024

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

Preview Abstract
Correlated Equilibria for Mean Field Games with Progressive Strategies

Pages:1072–1111

Published Online:April 29, 2024

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

Preview Abstract
Open Access
Estimating a Function and Its Derivatives Under a Smoothness Condition

Pages:1112–1138

Published Online:May 2, 2024

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

Preview Abstract
Learning and Balancing Unknown Loads in Large-Scale Systems

Pages:1139–1172

Published Online:May 3, 2024

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

Preview Abstract
Is There a Golden Parachute in Sannikov’s Principal–Agent Problem?

Pages:1173–1203

Published Online:May 6, 2024

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

Preview Abstract
Optimal Error Bounds in the Absence of Constraint Qualifications with Applications to p-Cones and Beyond

Pages:1204–1232

Published Online:May 9, 2024

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

Preview Abstract
Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions

Pages:1233–1249

Published Online:May 14, 2024

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

Preview Abstract
Robust Multiple Stopping—A Duality Approach

Pages:1250–1276

Published Online:May 15, 2024

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

Preview Abstract
Corruption-Robust Exploration in Episodic Reinforcement Learning

Pages:1277–1304

Published Online:May 23, 2024

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

Preview Abstract
Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme

Pages:1305–1332

Published Online:May 23, 2024

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

Preview Abstract
Confidence Intervals for Piecewise Normal Distributions and Stochastic Variational Inequalities

Pages:1333–1363

Published Online:May 24, 2024

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

Preview Abstract
Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

Pages:1364–1397

Published Online:June 4, 2024

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

Preview Abstract
On the Simplex Method for 0/1-Polytopes

Pages:1398–1420

Published Online:June 5, 2024

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

Preview Abstract
How to Design a Stable Serial Knockout Competition

Pages:1421–1432

Published Online:June 10, 2024

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

Preview Abstract
Procuring Unverifiable Information

Pages:1433–1453

Published Online:June 10, 2024

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

Preview Abstract
Hidden Convexity, Optimization, and Algorithms on Rotation Matrices

Pages:1454–1477

Published Online:July 1, 2024

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

Preview Abstract
Investment Timing and Technological Breakthroughs

Pages:1478–1513

Published Online:July 9, 2024

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

Preview Abstract
Rank-One Boolean Tensor Factorization and the Multilinear Polytope

Pages:1514–1554

Published Online:July 9, 2024

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

Preview Abstract
ρ-Arbitrage and ρ-Consistent Pricing for Star-Shaped Risk Measures

Pages:1555–1583

Published Online:July 9, 2024

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree