Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Articles

Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability

Pages:853–876

Published Online:April 3, 2026

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

Preview Abstract
Splitting Guarantees for Prophet Inequalities via Nonlinear Systems

Pages:877–904

Published Online:April 17, 2025

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

Preview Abstract
Riemannian Anderson Mixing Methods for Minimizing C2 Functions on Riemannian Manifolds

Pages:905–937

Published Online:April 25, 2025

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

Preview Abstract
Local Maximal Monotonicity in Variational Analysis and Optimization

Pages:938–955

Published Online:April 25, 2025

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

Preview Abstract
Tightness Without Counterexamples: A New Approach and New Results for Prophet Inequalities

Pages:956–987

Published Online:April 29, 2025

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

Preview Abstract
An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling

Pages:988–1006

Published Online:May 2, 2025

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

Preview Abstract
A Derivative-Free Algorithm for Minimization in One Dimension: Relaxation, Monte Carlo, and Sampling

Pages:1007–1036

Published Online:May 6, 2025

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

Preview Abstract
Positivstellensätze and Moment Problems with Universal Quantifiers

Pages:1037–1060

Published Online:May 7, 2025

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

Preview Abstract
Fair Congested Assignment

Pages:1061–1079

Published Online:May 7, 2025

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

Preview Abstract
On the Convergence Rate of Sinkhorn’s Algorithm

Pages:1080–1096

Published Online:May 8, 2025

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

Preview Abstract
Online Regret Bounds for Satisficing in Markov Decision Processes

Pages:1097–1119

Published Online:May 9, 2025

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

Preview Abstract
On the Sequential Convergence of Lloyd’s Algorithms

Pages:1120–1138

Published Online:May 9, 2025

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

Preview Abstract
Asymptotic Nash Equilibria of Finite-State Ergodic Markovian Mean Field Games

Pages:1139–1173

Published Online:May 9, 2025

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

Preview Abstract
Scarf’s Algorithm and Stable Marriages

Pages:1174–1204

Published Online:May 15, 2025

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

Preview Abstract
Cash-Subadditive Risk Measures Without Quasi-Convexity

Pages:1205–1226

Published Online:May 15, 2025

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

Preview Abstract
Fluid Limits for Longest Job First Queues

Pages:1227–1252

Published Online:May 15, 2025

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

Preview Abstract
A Homogeneous Second-Order Descent Method for Nonconvex Optimization

Pages:1253–1283

Published Online:May 19, 2025

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

Preview Abstract
Newton-CG Methods for Nonconvex Unconstrained Optimization with Hölder Continuous Hessian

Pages:1284–1311

Published Online:May 19, 2025

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

Preview Abstract
Efficient Simulation of Polyhedral Expectations with Applications to Finance

Pages:1312–1349

Published Online:May 20, 2025

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

Preview Abstract
Efficient and Near-Optimal Online Portfolio Selection

Pages:1350–1384

Published Online:May 22, 2025

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

Preview Abstract
Zero-Sum Mean-Field Dynkin Games: Characterization and Convergence

Pages:1385–1412

Published Online:May 22, 2025

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

Preview Abstract
Load Balancing in Parallel Queues and Rank-Based Diffusions

Pages:1413–1442

Published Online:May 27, 2025

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

Preview Abstract
Synchronization Games

Pages:1443–1462

Published Online:May 28, 2025

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

Preview Abstract
Fast Convergence of Frank-Wolfe Algorithms on Polytopes

Pages:1463–1485

Published Online:May 29, 2025

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

Preview Abstract
Improved Bounds for Single-Nomination Impartial Selection

Pages:1486–1513

Published Online:June 4, 2025

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

Preview Abstract
O’Neill’s Theorem for Games

Pages:1514–1537

Published Online:June 4, 2025

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

Preview Abstract
Higher-Order Expansion and Bartlett Correctability of Distributionally Robust Optimization

Pages:1538–1584

Published Online:June 6, 2025

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

Preview Abstract
Online Matching in Geometric Random Graphs

Pages:1585–1625

Published Online:June 11, 2025

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

Preview Abstract
A New Finite Approximation Method for Evaluating Steady-State Performance of a Continuous-State Markov Chain with an Application to Queues with Customer Abandonment

Pages:1626–1658

Published Online:June 12, 2025

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

Preview Abstract
Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems

Pages:1659–1682

Published Online:June 12, 2025

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

Preview Abstract
Improved Approximation Guarantees for Joint Replenishment in Continuous Time

Pages:1683–1712

Published Online:June 12, 2025

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

Preview Abstract

Editorial Board

Free Access
Editorial Board

Pages:iii–iii

Published Online:May 8, 2026

https://doi.org/10.1287/moor.2026.eb.v51n2

Previous
Back to Top
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