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 2021-05-01 to 2025-05-01.)
ArticleCitations
A Stochastic Representation for Nonlocal Parabolic PDEs with Applications150
Constrained Trading Networks64
Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models55
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem41
Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources34
Editorial Board25
Computation of Dynamic Equilibria in Series-Parallel Networks25
Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems24
A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP24
Solving Strong-Substitutes Product-Mix Auctions22
Stochastic Graphon Games: I. The Static Case22
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph22
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals19
Polyhedral Clinching Auctions for Two-Sided Markets19
Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization19
A Geometric Model of Opinion Polarization18
Finite State Mean Field Games with Wright–Fisher Common Noise as Limits ofN-Player Weighted Games16
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs16
On the Diameter of the Stopped Spider Process16
On the Simplex Method for 0/1-Polytopes15
Strong Algorithms for the Ordinal Matroid Secretary Problem14
Contextual Bandits with Cross-Learning14
Slater Condition for Tangent Derivatives14
Robust Online Selection with Uncertain Offer Acceptance14
Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic14
Fast Rates for the Regret of Offline Reinforcement Learning13
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks13
Distributionally Robust Inventory Control When Demand Is a Martingale13
A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint13
A Machine Learning Method for Stackelberg Mean Field Games13
Difference-of-Convex Algorithm with Extrapolation for Nonconvex, Nonsmooth Optimization Problems13
Pure Nash Equilibria and Best-Response Dynamics in Random Games12
Value Functions and Optimality Conditions for Nonconvex Variational Problems with an Infinite Horizon in Banach Spaces12
Editorial Board12
A Probabilistic Approach to Extended Finite State Mean Field Games11
On the Optimality of Affine Policies for Budgeted Uncertainty Sets11
A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions11
Equilibria in Multiclass and Multidimensional Atomic Congestion Games11
Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport11
Approximation and Convergence of Large Atomic Congestion Games11
Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements10
Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations10
Managing Customer Churn via Service Mode Control10
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes10
The Power of Subsampling in Submodular Maximization10
Reduction of Potential-Based Flow Networks10
A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition9
An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization9
Scalar Multivariate Risk Measures with a Single Eligible Asset9
Satiation in Fisher Markets and Approximation of Nash Social Welfare9
Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times9
Monotone Inclusions, Acceleration, and Closed-Loop Control9
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems9
A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian9
Optimal Partition for a Multi-Type Queueing System9
Large Ranking Games with Diffusion Control9
Linear and Utilitarian Choice Functions: Revisiting Myerson’s Theorem9
Multiagent Online Learning in Time-Varying Games9
A Riemannian Alternating Direction Method of Multipliers8
Multiplayer Bandits Without Observing Collision Information8
Equilibria and Systemic Risk in Saturated Networks8
On Integer Programming, Discrepancy, and Convolution8
Dissolving Constraints for Riemannian Optimization8
Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline7
Contingent Capital with Stock Price Triggers in Interbank Networks7
Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”7
A Classical Search Game in Discrete Locations7
Optimization Under Rational Expectations: A Framework of Fully Coupled Forward-Backward Stochastic Linear Quadratic Systems7
Steiner Cut Dominants7
Simulation of a Random Variable and its Application to Game Theory7
A Theory for Measures of Tail Risk7
Fair-Share Allocations for Agents with Arbitrary Entitlements7
Repeated Games with Incomplete Information over Predictable Systems7
Rate-Optimal Bayesian Simple Regret in Best Arm Identification7
ρ-Arbitrage and ρ-Consistent Pricing for Star-Shaped Risk Measures6
Distribution-Free Contextual Dynamic Pricing6
A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming6
A Mean Field Game of Optimal Portfolio Liquidation6
Game on Random Environment, Mean-Field Langevin System, and Neural Networks6
Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability6
Multivariate Monotone Inclusions in Saddle Form6
Large Deviations for the Single-Server Queue and the Reneging Paradox6
A Label-State Formulation of Stochastic Graphon Games and Approximate Equilibria on Large Networks6
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks6
Time-Varying Semidefinite Programs6
Diffusion of New Products with Heterogeneous Consumers6
How to Design a Stable Serial Knockout Competition6
Semidefinite Approximations for Bicliques and Bi-Independent Pairs6
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph6
Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes5
Polynomial Voting Rules5
Constrained Information Design5
A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn5
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes5
Conditional Uniformity and Hawkes Processes5
Large Independent Sets in Recursive Markov Random Graphs5
Sums of Separable and Quadratic Polynomials5
A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra5
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover5
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree5
Tractable Relaxations of Composite Functions5
Extension of Monotonic Functions and Representation of Preferences5
Relaxed Equilibria for Time-Inconsistent Markov Decision Processes5
The Folk Theorem for Repeated Games with Time-Dependent Discounting5
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory5
Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking5
Information Design and Sharing in Supply Chains5
Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time5
Convergence Analysis of Accelerated Stochastic Gradient Descent Under the Growth Condition5
Deep Quadratic Hedging5
Distributionally Robust Stochastic Optimization with Wasserstein Distance5
Penalty and Augmented Lagrangian Methods for Constrained DC Programming4
Langevin Dynamics Based Algorithm e-THεO POULA for Stochastic Optimization Problems with Discontinuous Stochastic Gradient4
Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems4
Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs4
Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion4
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis4
Exit Game with Private Information4
A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization4
Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities4
Fluid Limits for Longest Remaining Time First Queues4
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems4
Stationary Discounted and Ergodic Mean Field Games with Singular Controls4
From Perspective Maps to Epigraphical Projections4
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation4
The Competition Complexity of Dynamic Pricing4
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization4
Popularity, Mixed Matchings, and Self-Duality4
Dense Orbits of the Bayesian Updating Group Action4
Editorial Board4
A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods4
Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand4
Improved Guarantees for the A Priori TSP4
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem4
The Cost of Nonconvexity in Deterministic Nonsmooth Optimization4
Local Density Estimation in High Dimensions4
Quantitative Convergence for Displacement Monotone Mean Field Games with Controlled Volatility4
Bounding Residence Times for Atomic Dynamic Routings4
Order Independence in Sequential, Issue-by-Issue Voting4
Optimal Ratcheting of Dividends with Capital Injection4
Sampling from the Gibbs Distribution in Congestion Games4
Online Estimation and Optimization of Utility-Based Shortfall Risk4
(No-)Betting Pareto Optima Under Rank-Dependent Utility4
Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria4
Simplex Transformations and the Multiway Cut Problem4
Submodular Functions and Perfect Graphs4
On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime4
ɛ-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations4
Fair Cake Division Under Monotone Likelihood Ratios4
Reducing Bias in Event Time Simulations via Measure Changes4
Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers3
Strong Embeddings for Transitory Queueing Models3
A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes3
Editorial Board3
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint3
Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–1824)3
Editorial Board3
Diffusion-Based Staffing for Multitasking Service Systems with Many Servers3
A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information3
A Squared Smoothing Newton Method for Semidefinite Programming3
A Simple Characterization of Supply Correspondences3
The Minimax Property in Infinite Two-Person Win-Lose Games3
Global Algorithms for Mean-Variance Optimization in Markov Decision Processes3
Investment Timing and Technological Breakthroughs3
Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems3
On Polyhedral Approximations of the Positive Semidefinite Cone3
Zero-Sum Games and Linear Programming Duality3
Exploration Noise for Learning Linear-Quadratic Mean Field Games3
Dynkin Games with Incomplete and Asymmetric Information3
Small-Loss Bounds for Online Learning with Partial Information3
Nontruthful Position Auctions Are More Robust to Misspecification3
Intersection Disjunctions for Reverse Convex Sets3
Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming3
Optimal Electricity Demand Response Contracting with Responsiveness Incentives3
Oriented Calmness and Sweeping Process Dynamics3
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem3
Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model3
Secretaries with Advice3
On Degenerate Doubly Nonnegative Projection Problems2
Fair Allocation of Indivisible Goods: Improvement2
Uniform Mixed Equilibria in Network Congestion Games with Link Failures2
A Convex Form That Is Not a Sum of Squares2
Exact Optimal Stopping for Multidimensional Linear Switching Diffusions2
Corruption-Robust Exploration in Episodic Reinforcement Learning2
Optimal Investment Strategy for α-Robust Utility Maximization Problem2
Dual Solutions in Convex Stochastic Optimization2
Affine Storage and Insurance Risk Models2
Approximate Nash Equilibria in Large Nonconvex Aggregative Games2
Numeraire-Invariant Quadratic Hedging and Mean–Variance Portfolio Allocation2
A Generalized Newton Method for Subgradient Systems2
Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes2
The Competition Complexity of Prophet Inequalities2
Prophet Matching with General Arrivals2
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP2
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?2
Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits2
Rockafellian Relaxation and Stochastic Optimization Under Perturbations2
Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone2
Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number2
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online2
Nonzero-Sum Stochastic Games and Mean-Field Games with Impulse Controls2
Mixed-Integer Convex Representability2
A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians2
Correlated Equilibria and Mean Field Games: A Simple Model2
Parametric Shortest-Path Algorithms via Tropical Geometry2
Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon2
A Mean-Field Control Problem of Optimal Portfolio Liquidation with Semimartingale Strategies2
Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration2
Minimization Fractional Prophet Inequalities for Sequential Procurement2
A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems2
Distributional Transforms, Probability Distortions, and Their Applications2
Robust-to-Dynamics Optimization2
Generalization Bounds in the Predict-Then-Optimize Framework2
Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach2
A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem2
Probabilistic Analysis of Edge Elimination for Euclidean TSP2
Estimating a Function and Its Derivatives Under a Smoothness Condition2
Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem2
Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients2
On Optimality Conditions for Nonlinear Conic Programming2
The Buck-Passing Game2
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria2
Mean Field Analysis of Deep Neural Networks2
Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization2
Editorial Board2
Binary Extended Formulations and Sequential Convexification2
Optimal Retirement Under Partial Information2
Joint Mixability and Notions of Negative Dependence2
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users2
Data Exploration by Representative Region Selection: Axioms and Convergence2
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization2
Necessary and Sufficient Conditions for Rank-One-Generated Cones2
The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition2
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies2
Assortment Planning for Recommendations at Checkout Under Inventory Constraints2
Truthfulness of a Network Resource-Sharing Protocol2
Splitting Guarantees for Prophet Inequalities via Nonlinear Systems2
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue2
Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality2
McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations2
Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions2
Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model2
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds2
On Constrained Mixed-Integer DR-Submodular Minimization1
Minimal-Access Rights in School Choice and the Deferred Acceptance Mechanism1
Asymptotically Optimal Sequential Design for Rank Aggregation1
Consumption Smoothing and Discounting in Infinite-Horizon, Discrete-Choice Problems1
On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning1
Distributionally Robust Markov Decision Processes and Their Connection to Risk Measures1
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time1
0.069409847259521