Mathematics of Operations Research

2017 - 2026

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 51, issue 2, 2026

Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability pp. 853-876

Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande and Ernest van Wijland

Splitting Guarantees for Prophet Inequalities via Nonlinear Systems pp. 877-904

Johannes Brustle, Sebastian Perez-Salazar and Victor Verdugo

Riemannian Anderson Mixing Methods for Minimizing C 2 Functions on Riemannian Manifolds pp. 905-937

Zanyu Li and Chenglong Bao

Local Maximal Monotonicity in Variational Analysis and Optimization pp. 938-955

Pham Duy Khanh, Vu Vinh Huy Khoa, Boris S. Mordukhovich and Vo Thanh Phat

Tightness Without Counterexamples: A New Approach and New Results for Prophet Inequalities pp. 956-987

Jiashuo Jiang, Will Ma and Jiawei Zhang

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling pp. 988-1006

Jingyang Zhao and Mingyu Xiao

A Derivative-Free Algorithm for Minimization in One Dimension: Relaxation, Monte Carlo, and Sampling pp. 1007-1036

Alexandra A. Gomes and Diogo A. Gomes

Positivstellensätze and Moment Problems with Universal Quantifiers pp. 1037-1060

Xiaomeng Hu, Igor Klep and Jiawang Nie

Fair Congested Assignment pp. 1061-1079

Anna Bogomolnaia and Hervé Moulin

On the Convergence Rate of Sinkhorn’s Algorithm pp. 1080-1096

Promit Ghosal and Marcel Nutz

Online Regret Bounds for Satisficing in Markov Decision Processes pp. 1097-1119

Hossein Hajiabolhassan and Ronald Ortner

On the Sequential Convergence of Lloyd’s Algorithms pp. 1120-1138

Leo Portales, Elsa Cazelles and Edouard Pauwels

Asymptotic Nash Equilibria of Finite-State Ergodic Markovian Mean Field Games pp. 1139-1173

Asaf Cohen and Ethan Zell

Scarf’s Algorithm and Stable Marriages pp. 1174-1204

Yuri Faenza, Chengyue He and Jay Sethuraman

Cash-Subadditive Risk Measures Without Quasi-Convexity pp. 1205-1226

Xia Han, Qiuqi Wang, Ruodu Wang and Jianming Xia

Fluid Limits for Longest Job First Queues pp. 1227-1252

Łukasz Kruk

A Homogeneous Second-Order Descent Method for Nonconvex Optimization pp. 1253-1283

Chuwen Zhang, Chang He, Yuntian Jiang, Chenyu Xue, Bo Jiang, Dongdong Ge and Yinyu Ye

Newton-CG Methods for Nonconvex Unconstrained Optimization with Hölder Continuous Hessian pp. 1284-1311

Chuan He, Heng Huang and Zhaosong Lu

Efficient Simulation of Polyhedral Expectations with Applications to Finance pp. 1312-1349

Dohyun Ahn and Lewen Zheng

Efficient and Near-Optimal Online Portfolio Selection pp. 1350-1384

Rémi Jézéquel, Dmitrii Ostrovskii and Pierre Gaillard

Zero-Sum Mean-Field Dynkin Games: Characterization and Convergence pp. 1385-1412

Boualem Djehiche and Roxana Dumitrescu

Load Balancing in Parallel Queues and Rank-Based Diffusions pp. 1413-1442

Sayan Banerjee, Amarjit Budhiraja and Benjamin Estevez

Synchronization Games pp. 1443-1462

Felix Höfer and H. Mete Soner

Fast Convergence of Frank-Wolfe Algorithms on Polytopes pp. 1463-1485

Elias Wirth, Javier Peña and Sebastian Pokutta

Improved Bounds for Single-Nomination Impartial Selection pp. 1486-1513

Javier Cembrano, Felix Fischer and Max Klimm

O’Neill’s Theorem for Games pp. 1514-1537

Srihari Govindan, Rida Laraki and Lucas Pahl

Higher-Order Expansion and Bartlett Correctability of Distributionally Robust Optimization pp. 1538-1584

Shengyi He and Henry Lam

Online Matching in Geometric Random Graphs pp. 1585-1625

Flore Sentenac, Nathan Noiry, Matthieu Lerasle, Laurent Ménard and Vianney Perchet

A New Finite Approximation Method for Evaluating Steady-State Performance of a Continuous-State Markov Chain with an Application to Queues with Customer Abandonment pp. 1626-1658

Shukai Li and Sanjay Mehrotra

Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems pp. 1659-1682

Wei Liu, Qihang Lin and Yangyang Xu

Improved Approximation Guarantees for Joint Replenishment in Continuous Time pp. 1683-1712

Danny Segev

Volume 51, issue 1, 2026

Editor’s Comments on the 50th Anniversary of Mathematics of Operations Research pp. iv-viii

Katya Scheinberg

Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems pp. 1-34

Hanyang Li and Ying Cui

New Analysis of an Away-Step Frank–Wolfe Method for Minimizing Log-Homogeneous Barriers pp. 35-59

Renbo Zhao

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation pp. 60-91

Brian Hu Zhang, Gabriele Farina, Andrea Celli and Tuomas Sandholm

A Momentum-Based Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Optimization pp. 92-133

Qiankun Shi, Xiao Wang and Hao Wang

Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions pp. 134-148

Endre Boros and Joonhee Lee

Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline pp. 149-184

Weining Kang

Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion pp. 185-217

Uğur Aydin and Naci Saldi

The I.I.D. Prophet Inequality with Limited Flexibility pp. 218-254

Sebastian Perez-Salazar, Mohit Singh and Alejandro Toriello

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization pp. 255-276

Adam Kurpisz, Aaron Potechin and Elias Wirth

Optimal Partition for a Multi-Type Queueing System pp. 277-298

Shengyu Cao, Simai He, Zizhuo Wang and Yifan Feng

Streaming Submodular Maximization Under Matroid Constraints pp. 299-332

Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson and Rico Zenklusen

Square-Root Regret Bounds for Continuous-Time Episodic Markov Decision Processes pp. 333-357

Xuefeng Gao and Xunyu Zhou

Linear Mean-Field Games with Discounted Cost pp. 358-397

Naci Saldi

Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes pp. 398-439

Prakirt R. Jhunjhunwala, Martin Zubeldia and Siva Theja Maguluri

Global Algorithms for Mean-Variance Optimization in Markov Decision Processes pp. 440-455

Li Xia and Shuai Ma

Mode Connectivity in Auction Design pp. 456-475

Christoph Hertrich, Yixin Tao and László A. Végh

A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree pp. 476-497

Enrico Angelelli, Renata Mansini and Romeo Rizzi

Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities pp. 498-541

Hyun-Soo Ahn, Christopher Thomas Ryan, Joline Uichanco and Mengzhenyu Zhang

A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information pp. 542-567

Jie Xing, Jingtang Ma and Harry Zheng

Thompson Sampling for the Multinomial Logit Bandit pp. 568-590

Shipra Agrawal, Vashist Avadhanula, Vineet Goyal and Assaf Zeevi

Convergence of Augmented Lagrangian Methods for Composite Optimization Problems pp. 591-620

Nguyen Thi Van Hang and Ebrahim Sarabi

Probabilistic Analysis of Edge Elimination for Euclidean TSP pp. 621-640

Xianghui Zhong

The Competition Complexity of Prophet Inequalities pp. 641-665

Johannes Brustle, José Correa, Paul Dütting, Tomer Ezra, Michal Feldman and Victor Verdugo

Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–1824) pp. 666-667

Takashi Kunimoto, Rene Saran and Roberto Serrano

Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic pp. 668-685

Jin Guang, Xinyun Chen and J. G. Dai

Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria pp. 686-714

Lei Yang and Kim-Chuan Toh

AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization pp. 715-745

Danqing Zhou, Shiqian Ma and Junfeng Yang

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems pp. 746-782

Quoc Tran-Dinh and Yang Luo

How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices? pp. 783-805

Shuji Kijima, Nobutaka Shimizu and Takeharu Shiraga

Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs pp. 806-828

Ritesh Goenka, Eashan Gupta, Sushil Khyalia and Shivaram Kalyanakrishnan

A Universally Efficient Dynamic Auction for All Unimodular Demand Types pp. 829-851

Satoru Fujishige and Zaifu Yang