Mathematics of Operations Research

Papers
(The median citation count of Mathematics of Operations Research is 2. 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-05-01 to 2026-05-01.)
ArticleCitations
Online Allocation of Reusable Resources in Nonstationary Environments288
Optimality Conditions at Infinity in Semialgebraic Vector Optimization46
A New Finite Approximation Method for Evaluating Steady-State Performance of a Continuous-State Markov Chain with an Application to Queues with Customer Abandonment41
Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization36
On the Diameter of the Stopped Spider Process32
A Geometric Model of Opinion Polarization30
Solving Strong-Substitutes Product-Mix Auctions30
Many-Server Asymptotics for Join-the-Shortest-Queue in the Super-Halfin-Whitt Scaling Window30
A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP28
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem27
Constrained Trading Networks26
Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources26
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph25
A Stochastic Representation for Nonlocal Parabolic PDEs with Applications24
Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems23
On the Equivalence of Zero-Sum Games and Conic Programs23
Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models21
Difference-of-Convex Algorithm with Extrapolation for Nonconvex, Nonsmooth Optimization Problems21
Slater Condition for Tangent Derivatives20
The Information Projection in Moment Inequality Models: Existence, Dual Representation, and Approximation19
Contextual Bandits with Cross-Learning19
Finite State Mean Field Games with Wright–Fisher Common Noise as Limits ofN-Player Weighted Games19
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks18
Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems18
Fast Rates for the Regret of Offline Reinforcement Learning17
The Complexity of Recognizing Facets for the Knapsack Polytope17
Robust Online Selection with Uncertain Offer Acceptance16
Nonregular McKean–Vlasov Equations and Calibration Problem in Local Stochastic Volatility Models15
A Machine Learning Method for Stackelberg Mean Field Games15
Distributionally Robust Inventory Control When Demand Is a Martingale15
On the Simplex Method for 0/1-Polytopes14
Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times14
Editorial Board14
Reduction of Potential-Based Flow Networks14
Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic14
A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint14
A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions13
Developing Lagrangian-Based Methods for Nonsmooth Nonconvex Optimization13
A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition13
Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport12
Equilibria in Multiclass and Multidimensional Atomic Congestion Games12
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes12
The Power of Subsampling in Submodular Maximization12
Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements12
Optimal Partition for a Multi-Type Queueing System11
Linear and Utilitarian Choice Functions: Revisiting Myerson’s Theorem11
Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations11
Managing Customer Churn via Service Mode Control11
Steiner Cut Dominants11
Approximation and Convergence of Large Atomic Congestion Games11
Fair and Efficient Multi-resource Allocation for Cloud Computing: Beyond Dominant Resource Fairness11
Satiation in Fisher Markets and Approximation of Nash Social Welfare10
Equilibria and Systemic Risk in Saturated Networks10
Large Ranking Games with Diffusion Control10
Scalar Multivariate Risk Measures with a Single Eligible Asset10
Fair-Share Allocations for Agents with Arbitrary Entitlements10
Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline10
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems10
Unbiased Least Squares Regression via Averaged Stochastic Gradient Descent10
Editorial Board10
On Integer Programming, Discrepancy, and Convolution9
Multiplayer Bandits Without Observing Collision Information9
A Riemannian Alternating Direction Method of Multipliers9
Monotone Inclusions, Acceleration, and Closed-Loop Control9
A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian9
Dissolving Constraints for Riemannian Optimization9
Optimization Under Rational Expectations: A Framework of Fully Coupled Forward-Backward Stochastic Linear Quadratic Systems9
An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization9
Multiagent Online Learning in Time-Varying Games9
Contingent Capital with Stock Price Triggers in Interbank Networks9
Repeated Games with Incomplete Information over Predictable Systems8
Rate-Optimal Bayesian Simple Regret in Best Arm Identification8
A Classical Search Game in Discrete Locations8
How to Design a Stable Serial Knockout Competition8
ρ-Arbitrage and ρ-Consistent Pricing for Star-Shaped Risk Measures8
A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming8
Game on Random Environment, Mean-Field Langevin System, and Neural Networks8
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks8
Semidefinite Approximations for Bicliques and Bi-Independent Pairs8
Multivariate Monotone Inclusions in Saddle Form7
Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability7
Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking7
Distribution-Free Contextual Dynamic Pricing7
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree7
Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”7
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover7
Utility Maximization Under Endogenous Pricing7
A Single-Loop Algorithm for Decentralized Bilevel Optimization7
A Label-State Formulation of Stochastic Graphon Games and Approximate Equilibria on Large Networks7
Constrained Information Design7
Asymptotic Nash Equilibria of Finite-State Ergodic Markovian Mean Field Games7
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph7
Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes7
Diffusion of New Products with Heterogeneous Consumers7
A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra7
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes6
Online Estimation and Optimization of Utility-Based Shortfall Risk6
Improved Guarantees for the A Priori TSP6
Deep Quadratic Hedging6
Fluid Limits for Longest Job First Queues6
Tractable Relaxations of Composite Functions6
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory6
Convergence Analysis of Accelerated Stochastic Gradient Descent Under the Growth Condition6
Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs6
Conditional Uniformity and Hawkes Processes6
The Competition Complexity of Dynamic Pricing6
Information Design and Sharing in Supply Chains6
Editorial Board6
Large Independent Sets in Recursive Markov Random Graphs6
The Folk Theorem for Repeated Games with Time-Dependent Discounting6
Sums of Separable and Quadratic Polynomials6
Relaxed Equilibria for Time-Inconsistent Markov Decision Processes6
Distributionally Robust Stochastic Optimization with Wasserstein Distance6
Polynomial Voting Rules6
A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn6
Langevin Dynamics Based Algorithm e-THεO POULA for Stochastic Optimization Problems with Discontinuous Stochastic Gradient5
Lipschitz Stability of Least-Squares Problems Regularized by Functions with C2-Cone Reducible Conjugates5
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems5
Analysis of the Primal-Dual Central Path for Nonlinear Semidefinite Optimization Without the Nondegeneracy Condition5
Fluid Limits for Longest Remaining Time First Queues5
Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities5
A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games5
Can Learning Be Explained by Local Optimality in Robust Low-Rank Matrix Recovery?5
A Simple 1.5-Approximation Algorithm for a Wide Range of Maximum-Size Stable Matching Problems5
The Cost of Nonconvexity in Deterministic Nonsmooth Optimization5
Sampling from the Gibbs Distribution in Congestion Games5
Quantitative Convergence for Displacement Monotone Mean Field Games with Controlled Volatility5
Order Independence in Sequential, Issue-by-Issue Voting5
Robust Solutions to a System of Stochastic Vertical Linear Complementarity Problems5
Efficient and Near-Optimal Online Portfolio Selection5
Editorial Board5
Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion5
Reducing Bias in Event Time Simulations via Measure Changes5
Optimal Ratcheting of Dividends with Capital Injection5
From Perspective Maps to Epigraphical Projections5
Local Density Estimation in High Dimensions5
Penalty and Augmented Lagrangian Methods for Constrained DC Programming5
Editor’s Comments on the 50th Anniversary of Mathematics of Operations Research5
Stationary Discounted and Ergodic Mean Field Games with Singular Controls5
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem5
Two Typical Implementable Semismooth* Newton Methods for Generalized Equations Are G-Semismooth Newton Methods5
Improved Bounds for Single-Nomination Impartial Selection5
Editorial Board5
Unichain and Aperiodicity Are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits5
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis5
(No-)Betting Pareto Optima Under Rank-Dependent Utility5
Fair Cake Division Under Monotone Likelihood Ratios5
Bounding Residence Times for Atomic Dynamic Routings5
Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems5
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation5
Online Regret Bounds for Satisficing in Markov Decision Processes4
Nontruthful Position Auctions Are More Robust to Misspecification4
Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria4
Diffusion-Based Staffing for Multitasking Service Systems with Many Servers4
Global Algorithms for Mean-Variance Optimization in Markov Decision Processes4
Fast Convergence of Frank-Wolfe Algorithms on Polytopes4
Editorial Board4
Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems4
Investment Timing and Technological Breakthroughs4
Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers4
Algorithms for Budget-Constrained D-Optimal Design4
Editorial Board4
A Simple Characterization of Supply Correspondences4
A Squared Smoothing Newton Method for Semidefinite Programming4
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint4
Exploration Noise for Learning Linear-Quadratic Mean Field Games4
Splitting Guarantees for Prophet Inequalities via Nonlinear Systems4
Exit Game with Private Information4
Oriented Calmness and Sweeping Process Dynamics4
Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming4
Optimal Electricity Demand Response Contracting with Responsiveness Incentives4
Secretaries with Advice4
Submodular Functions and Perfect Graphs4
Approximately Stationary Bandits with Knapsacks4
Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model4
A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods4
The Minimax Property in Infinite Two-Person Win-Lose Games4
Strong Embeddings for Transitory Queueing Models4
Fair Congested Assignment4
On Optimality Conditions for Nonlinear Conic Programming4
A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes4
Estimating a Function and Its Derivatives Under a Smoothness Condition4
A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem4
Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability4
Small-Loss Bounds for Online Learning with Partial Information4
Generalized Ellipsoids4
Robustly Stable Accelerated Momentum Methods with a Near-Optimal L2 Gain and H∞ Performance4
Dual Solutions in Convex Stochastic Optimization3
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online3
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies3
Correlated Equilibria and Mean Field Games: A Simple Model3
Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions3
A Convex Form That Is Not a Sum of Squares3
A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians3
Semistatic Variance-Optimal Hedging with Self-Exciting Jumps3
The Buck-Passing Game3
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems3
On the Convergence Rate of Sinkhorn’s Algorithm3
Zero-Sum Games and Linear Programming Duality3
Uniform Mixed Equilibria in Network Congestion Games with Link Failures3
McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations3
Effort Decisions in Contests with Shared Attributes3
Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality3
Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon3
Assortment Planning for Recommendations at Checkout Under Inventory Constraints3
Binary Extended Formulations and Sequential Convexification3
An Adaptive Forward-Backward-Forward Splitting Algorithm for Solving Pseudo-Monotone Inclusions3
On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning3
Corruption-Robust Exploration in Episodic Reinforcement Learning3
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds3
The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition3
Probabilistic Analysis of Edge Elimination for Euclidean TSP3
A Generalized Newton Method for Subgradient Systems3
Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem3
Synchronization Games3
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria3
Generalization Bounds in the Predict-Then-Optimize Framework3
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue3
Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes3
Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model3
Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–3
Branch-and-Bound Algorithms as Polynomial-Time Approximation Schemes3
Prophet Matching with General Arrivals3
Single-Server Queues with State-Dependent Hawkes Arrivals3
A Sampling-Based Gittins Index Approximation3
Editorial Board3
On Degenerate Doubly Nonnegative Projection Problems3
Bilevel Gradient Methods and the Morse Parametric Qualification Condition3
Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration3
Truthfulness of a Network Resource-Sharing Protocol3
Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization3
Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number3
Joint Mixability and Notions of Negative Dependence3
Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits3
A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information3
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP3
Rockafellian Relaxation and Stochastic Optimization Under Perturbations3
Approximate Nash Equilibria in Large Nonconvex Aggregative Games3
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?3
On Stability of the Scholtes Regularization for Mathematical Programs with Complementarity Constraints3
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design2
Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability2
Interim Rationalizable Implementation of Functions2
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution2
Graphon Games with Multiple Equilibria: Analysis and Computation2
Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria2
Worst-Case Iteration Bounds for Log Barrier Methods on Problems with Nonconvex Constraints2
Nonzero-Sum Optimal Stopping Game with Continuous vs. Periodic Exercise Opportunities2
Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs2
Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs2
0.096472978591919