Mathematics of Operations Research

Papers
(The median citation count of Mathematics of Operations Research is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-08-01 to 2026-08-01.)
ArticleCitations
On the Diameter of the Stopped Spider Process330
Many-Server Asymptotics for Join-the-Shortest-Queue in the Super-Halfin-Whitt Scaling Window49
Solving Strong-Substitutes Product-Mix Auctions46
Constrained Trading Networks40
On the Equivalence of Zero-Sum Games and Conic Programs38
Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems34
A Stochastic Representation for Nonlocal Parabolic PDEs with Applications34
A Geometric Model of Opinion Polarization32
A New Finite Approximation Method for Evaluating Steady-State Performance of a Continuous-State Markov Chain with an Application to Queues with Customer Abandonment32
Optimality Conditions at Infinity in Semialgebraic Vector Optimization31
A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP27
Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models26
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph25
Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization24
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem22
The Information Projection in Moment Inequality Models: Existence, Dual Representation, and Approximation22
Online Allocation of Reusable Resources in Nonstationary Environments22
Contextual Bandits with Cross-Learning20
Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems19
Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic19
The Complexity of Recognizing Facets for the Knapsack Polytope19
Nonregular McKean–Vlasov Equations and Calibration Problem in Local Stochastic Volatility Models18
Robust Online Selection with Uncertain Offer Acceptance17
Distributionally Robust Inventory Control When Demand Is a Martingale17
Difference-of-Convex Algorithm with Extrapolation for Nonconvex, Nonsmooth Optimization Problems16
Fast Rates for the Regret of Offline Reinforcement Learning16
On the Simplex Method for 0/1-Polytopes16
A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint16
Slater Condition for Tangent Derivatives15
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks14
Finite State Mean Field Games with Wright–Fisher Common Noise as Limits ofN-Player Weighted Games14
Reduction of Potential-Based Flow Networks14
A Machine Learning Method for Stackelberg Mean Field Games14
Scale-Free Cascading Failures: Generalized Approach for All Simple, Connected Graphs13
Approximation Algorithms for Steiner Connectivity Augmentation13
Approximation and Convergence of Large Atomic Congestion Games13
A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition13
Optimal Partition for a Multi-Type Queueing System12
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes12
A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions12
Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements12
Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times12
Equilibria in Multiclass and Multidimensional Atomic Congestion Games12
Unbiased Least Squares Regression via Averaged Stochastic Gradient Descent11
Equilibria and Systemic Risk in Saturated Networks11
Fair and Efficient Multi-resource Allocation for Cloud Computing: Beyond Dominant Resource Fairness11
Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport11
Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline11
Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations11
Developing Lagrangian-Based Methods for Nonsmooth Nonconvex Optimization11
Steiner Cut Dominants11
Managing Customer Churn via Service Mode Control11
An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization10
Satiation in Fisher Markets and Approximation of Nash Social Welfare10
A Classical Search Game in Discrete Locations10
Contingent Capital with Stock Price Triggers in Interbank Networks10
Optimization Under Rational Expectations: A Framework of Fully Coupled Forward-Backward Stochastic Linear Quadratic Systems10
Dissolving Constraints for Riemannian Optimization10
Monotone Inclusions, Acceleration, and Closed-Loop Control10
Editorial Board10
Large Ranking Games with Diffusion Control9
Fair-Share Allocations for Agents with Arbitrary Entitlements9
Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”9
Semidefinite Approximations for Bicliques and Bi-Independent Pairs9
Multiagent Online Learning in Time-Varying Games9
A Riemannian Alternating Direction Method of Multipliers9
A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming9
On Integer Programming, Discrepancy, and Convolution9
A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian9
How to Design a Stable Serial Knockout Competition9
Game on Random Environment, Mean-Field Langevin System, and Neural Networks9
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks8
Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability8
Mean-Field Games of Speedy Information Access with Observation Costs8
Utility Maximization Under Endogenous Pricing8
Rate-Optimal Bayesian Simple Regret in Best Arm Identification8
Distribution-Free Contextual Dynamic Pricing8
Diffusion of New Products with Heterogeneous Consumers8
A Label-State Formulation of Stochastic Graphon Games and Approximate Equilibria on Large Networks8
Asymptotic Nash Equilibria of Finite-State Ergodic Markovian Mean Field Games8
ρ-Arbitrage and ρ-Consistent Pricing for Star-Shaped Risk Measures8
Repeated Games with Incomplete Information over Predictable Systems8
Polynomial Voting Rules7
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree7
Editorial Board7
Information Design and Sharing in Supply Chains7
Convergence Analysis of Accelerated Stochastic Gradient Descent Under the Growth Condition7
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover7
Constrained Information Design7
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory7
Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking7
Large Independent Sets in Recursive Markov Random Graphs7
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes7
Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes7
A Single-Loop Algorithm for Decentralized Bilevel Optimization7
A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra7
Distributionally Robust Stochastic Optimization with Wasserstein Distance7
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph7
Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs7
Fluid Limits for Longest Job First Queues7
A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn7
Improved Guarantees for the A Priori TSP6
The Competition Complexity of Dynamic Pricing6
Sums of Separable and Quadratic Polynomials6
Quantitative Convergence for Displacement Monotone Mean Field Games with Controlled Volatility6
Optimal Ratcheting of Dividends with Capital Injection6
Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems6
Sampling from the Gibbs Distribution in Congestion Games6
Online Estimation and Optimization of Utility-Based Shortfall Risk6
Relaxed Equilibria for Time-Inconsistent Markov Decision Processes6
Langevin Dynamics Based Algorithm e-THεO POULA for Stochastic Optimization Problems with Discontinuous Stochastic Gradient6
Editor’s Comments on the 50th Anniversary of Mathematics of Operations Research6
Lipschitz Stability of Least-Squares Problems Regularized by Functions with C2-Cone Reducible Conjugates6
The Cost of Nonconvexity in Deterministic Nonsmooth Optimization6
Can Learning Be Explained by Local Optimality in Robust Low-Rank Matrix Recovery?6
Conditional Uniformity and Hawkes Processes6
Order Independence in Sequential, Issue-by-Issue Voting6
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation6
Relaxations for Binary Polynomial Optimization via Signed Certificates6
Penalty and Augmented Lagrangian Methods for Constrained DC Programming6
Stationary Discounted and Ergodic Mean Field Games with Singular Controls6
Deep Quadratic Hedging6
Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion5
Two Typical Implementable Semismooth* Newton Methods for Generalized Equations Are G-Semismooth Newton Methods5
Robust Solutions to a System of Stochastic Vertical Linear Complementarity Problems5
(No-)Betting Pareto Optima Under Rank-Dependent Utility5
Local Density Estimation in High Dimensions5
Editorial Board5
Exit Game with Private Information5
Improved Bounds for Single-Nomination Impartial Selection5
Robustly Stable Accelerated Momentum Methods with a Near-Optimal L2 Gain and H∞ Performance5
Global Algorithms for Mean-Variance Optimization in Markov Decision Processes5
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis5
Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities5
Bounding Residence Times for Atomic Dynamic Routings5
Coderivatives at Infinity of Set-Valued Mappings with Applications to Optimization5
From Perspective Maps to Epigraphical Projections5
Fair Cake Division Under Monotone Likelihood Ratios5
Editorial Board5
Algorithms for Budget-Constrained D-Optimal Design5
Generalized Ellipsoids5
Analysis of the Primal-Dual Central Path for Nonlinear Semidefinite Optimization Without the Nondegeneracy Condition5
Efficient and Near-Optimal Online Portfolio Selection5
A Simple 1.5-Approximation Algorithm for a Wide Range of Maximum-Size Stable Matching Problems5
Fluid Limits for Longest Remaining Time First Queues5
Unichain and Aperiodicity Are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits5
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem5
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems5
Editorial Board5
Submodular Functions and Perfect Graphs5
A Squared Smoothing Newton Method for Semidefinite Programming5
Approximately Stationary Bandits with Knapsacks5
Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria5
A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games5
A Simple Characterization of Supply Correspondences4
Diffusion-Based Staffing for Multitasking Service Systems with Many Servers4
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint4
Fair Congested Assignment4
Optimal Electricity Demand Response Contracting with Responsiveness Incentives4
Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability4
Fast Convergence of Frank-Wolfe Algorithms on Polytopes4
Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–4
Zero-Sum Games and Linear Programming Duality4
Editorial Board4
Small-Loss Bounds for Online Learning with Partial Information4
Online Regret Bounds for Satisficing in Markov Decision Processes4
Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model4
Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming4
Exploration Noise for Learning Linear-Quadratic Mean Field Games4
The Minimax Property in Infinite Two-Person Win-Lose Games4
Investment Timing and Technological Breakthroughs4
A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information4
Editorial Board4
A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem4
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?4
Nontruthful Position Auctions Are More Robust to Misspecification4
Secretaries with Advice4
Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers4
Oriented Calmness and Sweeping Process Dynamics4
Market Design with Distributional Objectives4
Assortment Planning for Recommendations at Checkout Under Inventory Constraints4
Rockafellian Relaxation and Stochastic Optimization Under Perturbations4
On Optimality Conditions for Nonlinear Conic Programming4
Estimating a Function and Its Derivatives Under a Smoothness Condition4
Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions3
Generalization Bounds in the Predict-Then-Optimize Framework3
On Stability of the Scholtes Regularization for Mathematical Programs with Complementarity Constraints3
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online3
Joint Mixability and Notions of Negative Dependence3
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds3
McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations3
On Degenerate Doubly Nonnegative Projection Problems3
Uniform Mixed Equilibria in Network Congestion Games with Link Failures3
Semistatic Variance-Optimal Hedging with Self-Exciting Jumps3
Monotone Causality in Opportunistically Stochastic Shortest Path Problems3
Dual Solutions in Convex Stochastic Optimization3
Generalized Eluder Coefficient: A Unified Framework for Interactive Decision Making in Markov Decision Processes, Partially Observable Markov Decision Processes, and Beyond3
On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning3
Single-Server Queues with State-Dependent Hawkes Arrivals3
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP3
Branch-and-Bound Algorithms as Polynomial-Time Approximation Schemes3
Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number3
Corruption-Robust Exploration in Episodic Reinforcement Learning3
On the Convergence Rate of Sinkhorn’s Algorithm3
Correlated Equilibria and Mean Field Games: A Simple Model3
Synchronization Games3
The Buck-Passing Game3
Binary Extended Formulations and Sequential Convexification3
Probabilistic Analysis of Edge Elimination for Euclidean TSP3
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria3
Effort Decisions in Contests with Shared Attributes3
Newton-CG Methods for Nonconvex Unconstrained Optimization with Hölder Continuous Hessian3
A Generalized Newton Method for Subgradient Systems3
Equilibrium Transport with Time-Inconsistent Costs3
Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model3
Optimal Investment Strategy for α-Robust Utility Maximization Problem3
Editorial Board3
A Sampling-Based Gittins Index Approximation3
Envy-Freeness up to Any Good Allocations on Graphs3
Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon3
Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits3
A Convex Form That Is Not a Sum of Squares3
Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem3
The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition3
Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization3
Bicriteria Multidimensional Mechanism Design with Side Information3
Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality3
Non-SOS Positivstellensätze for Semialgebraic Sets Defined by Polynomial Matrix Inequalities3
Splitting Guarantees for Prophet Inequalities via Nonlinear Systems3
A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians3
A Homogeneous Second-Order Descent Method for Nonconvex Optimization3
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems3
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue3
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies3
An Adaptive Forward-Backward-Forward Splitting Algorithm for Solving Pseudo-Monotone Inclusions3
Truthfulness of a Network Resource-Sharing Protocol3
Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration3
Bilevel Gradient Methods and the Morse Parametric Qualification Condition3
Approximate Nash Equilibria in Large Nonconvex Aggregative Games3
Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Step Sizes2
Interim Rationalizable Implementation of Functions2
Gale’s Fixed Tax for Exchanging Houses2
Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs2
Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria2
Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability2
Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs2
Data-Driven Matching for Impatient and Heterogeneous Demand and Supply2
Graphon Games with Multiple Equilibria: Analysis and Computation2
The Finite-Horizon Retirement Problem with Borrowing Constraint: A Zero-Sum Stopper Versus Singular-Controller Game2
On Time-Inconsistent Extended Mean-Field Control Problems with Common Noise2
0.42472791671753