Operations Research

Papers
(The median citation count of Operations Research is 4. 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-01-01 to 2026-01-01.)
ArticleCitations
Editorial Board93
Editorial Board75
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints74
Fast Quantum Subroutines for the Simplex Method67
Scores for Multivariate Distributions and Level Sets61
Portfolio Selection, Periodic Evaluations and Risk Taking58
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks58
Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions51
Introduction: Special Issue Honoring Kenneth Arrow50
Black-Box Acceleration of Monotone Convex Program Solvers50
Asymptotically Tight Bounds on the Optimal Pricing Strategy with Patient Customers49
Side-Constrained Dynamic Traffic Equilibria48
Fast and Simple Solutions of Blotto Games47
Optimal Dynamic Momentum Strategies43
Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis42
Comparing Sequential Forecasters41
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach41
Community-Engaged School District Design: A Stream-Based Approach40
Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets39
Change-Point Detection in Dynamic Networks with Missing Links39
The Price of Fairness of Scheduling a Scarce Resource38
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems38
Optimal Cash Management with Payables Finance37
Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution36
Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem36
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints34
Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions33
On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment32
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems31
Adversarial Patrolling in a Uniform31
Deepest Cuts for Benders Decomposition31
Package Bids in Combinatorial Electricity Auctions: Selection, Welfare Losses, and Alternatives31
Does the Prohibition of Trade-Through Hurt Liquidity Demanders?31
Quality Selection in Two-Sided Markets: A Constrained Price Discrimination Approach30
Data-Driven Ranking and Selection Under Input Uncertainty30
Structural Estimation of Markov Decision Processes in High-Dimensional State Space with Finite-Time Guarantees30
Optimal Regularized Online Allocation by Adaptive Re-Solving30
Editorial Board30
Optimal Learning Under Robustness and Time-Consistency30
Network Revenue Management Under a Spiked Multinomial Logit Choice Model29
Technical Note—First-Stage Sampling in Ranking and Selection: Beyond Variance Estimation29
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds29
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders29
Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds28
Efficient Learning for Clustering and Optimizing Context-Dependent Designs28
Asymptotic Optimality of Semi-Open-Loop Policies in Markov Decision Processes with Large Lead Times27
In This Issue27
In This Apportionment Lottery, the House Always Wins27
A Stationary Mean-Field Equilibrium Model of Irreversible Investment in a Two-Regime Economy27
Technical Note—Greedy Algorithm for Multiway Matching with Bounded Regret26
A First-Order Approach to Accelerated Value Iteration26
Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays26
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem25
Enhanced Balancing of Bias-Variance Tradeoff in Stochastic Estimation: A Minimax Perspective24
Exit Spirals in Coupled Networked Markets24
Robust Queue Inference from Waiting Times24
On Solving a Class of Continuous Traffic Equilibrium Problems and Planning Facility Location Under Congestion24
In This Issue24
Stochastic Knapsack Revisited: The Service Level Perspective23
Optimizing the Path Towards Plastic-Free Oceans23
A Planner-Trader Decomposition for Multimarket Hydro Scheduling23
Gradient-Based Algorithms for Convex Discrete Optimization via Simulation22
Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing22
Production Planning with Risk Hedging Under a Conditional Value at Risk Objective22
Jointly Modeling and Clustering Tensors in High Dimensions22
Near-Optimal Pricing and Resource Allocation in a Large-Scale Service System21
A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce21
Modeling the Risk in Mortality Projections21
Monetizing Positive Externalities to Mitigate the Infrastructure Underinvestment Problem21
Feature-Based Dynamic Matching20
Dynamic Pricing and Matching for Two-Sided Queues20
Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs20
Statistical Inference for Aggregation of Malmquist Productivity Indices20
The Gatekeeper’s Dilemma: “When Should I Transfer This Customer?”20
Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs20
Political Districting to Minimize County Splits19
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming19
Is Your Price Personalized? Alleviating Customer Concerns with Inventory Availability Information19
Editorial Board19
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence19
Computing Constrained Shortest-Paths at Scale19
Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes19
Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach18
Dual-Directed Algorithm Design for Efficient Pure Exploration18
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities18
Spectral Ranking Inferences Based on General Multiway Comparisons18
To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment18
A Pareto Dominance Principle for Data-Driven Optimization17
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation17
Smoothness-Adaptive Contextual Bandits17
The Analytics of Bed Shortages: Coherent Metric, Prediction, and Optimization17
Minimax Optimal Estimation of Stability Under Distribution Shift17
Hard and Soft Defense Against a Sequence of Aerial Threats17
Market Making and Incentives Design in the Presence of a Dark Pool: A Stackelberg Actor–Critic Approach16
E-Commerce Order Fulfillment Problem with Limited Time Window16
Consistency Cuts for Dantzig-Wolfe Reformulations16
Optimal No-Regret Learning in Repeated First-Price Auctions16
Technical Note—Multistage Robust Mixed-Integer Programming16
Optimal Pricing and Introduction Timing of Technology Upgrades in Subscription-Based Services16
Binary Diversification Characterizes Exact Capacities16
Learning Product Rankings Robust to Fake Users16
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings16
Data Aggregation and Demand Prediction15
Selection of the Most Probable Best15
Pooling Agents for Customer-Intensive Services15
Procurement for Assembly Systems Under Supply Uncertainty: Optimal Mechanisms15
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems15
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis15
The Fragility of Optimized Bandit Algorithms15
A Data-Driven Approach to Improve Artisans’ Productivity in Distributed Supply Chains15
Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement15
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models15
Early Reservation for Follow-up Appointments in a Slotted-Service Queue15
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching15
Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator15
Distributionally Robust Optimization Under Distorted Expectations15
1.79-Approximation Algorithms for Continuous Review Single-Sourcing Lost-Sales and Dual-Sourcing Inventory Models14
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity14
Data-Driven Minimax Optimization with Expectation Constraints14
Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls14
Systemic Risk-Driven Portfolio Selection14
On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs14
Inventory Sharing for Perishable Products: Application to Platelet Inventory Management in Hospital Blood Banks14
A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation14
Rate-Optimal Online Learning for Dynamic Assortment Selection with Positioning14
Distributionally Robust Linear and Discrete Optimization with Marginals13
Harvesting Solar Power Foments Prices in a Vicious Cycle: Breaking the Cycle with Price Mechanisms13
Infinite-Dimensional Fisher Markets and Tractable Fair Division13
Subsampling to Enhance Efficiency in Input Uncertainty Quantification13
The Value of Coordination in Multimarket Bidding of Grid Energy Storage13
Single-Product Assemble-to-Order Systems with Exogenous Lead Times13
You Are the Best Reviewer of Your Own Papers: The Isotonic Mechanism13
Axiomatizing the Bayesian Paradigm in Parallel Small Worlds13
Contextual Search in the Presence of Adversarial Corruptions13
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria13
Shortest-Job-First Scheduling in Many-Server Queues with Impatient Customers and Noisy Service-Time Estimates13
Dual Moments and Risk Attitudes12
Optimal Auction Design with Deferred Inspection and Reward12
Establishing Convergence of Infinite-Server Queues with Batch Arrivals to Shot-Noise Processes12
When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence12
Fast Core Pricing for Rich Advertising Auctions12
A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity12
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs12
Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems12
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback12
Lagrangian Inference for Ranking Problems12
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem12
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides12
Persuading Risk-Conscious Agents: A Geometric Approach12
Robust Assortment Optimization Under the Markov Chain Choice Model12
Need for Speed: The Impact of In-Process Delays on Customer Behavior in Online Retail12
Optimal Sequential Multiclass Diagnosis12
Learning to Schedule in Multiclass Many-Server Queues with Abandonment12
Load Balancing Using Sparse Communication12
Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback12
New Venture Creation: A Drift-Variance Diffusion Control Model12
Scalable Reinforcement Learning for Multiagent Networked Systems12
Post Reinforcement Learning Inference12
Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms12
Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games12
Reliable Off-Policy Evaluation for Reinforcement Learning11
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation11
Always Valid Inference: Continuous Monitoring of A/B Tests11
Process Flexibility: A Distribution-Free Approach to Long Chain Resilience11
Building a Location-Based Set of Social Media Users11
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators11
Dynamic Stochastic Matching Under Limited Time11
Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics11
Many-Server Queueing Systems with Heterogeneous Strategic Servers in Heavy Traffic11
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements11
Matching Drivers to Riders: A Two-Stage Robust Approach11
Market Efficient Portfolios in a Systemic Economy11
Detecting Bots and Assessing Their Impact in Social Networks11
Naive Learning Through Probability Overmatching11
Revenue Management of a Professional Services Firm with Quality Revelation11
An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow11
The Anchor-Robust Project Scheduling Problem11
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation11
Regularized Aggregation of One-Off Probability Predictions11
Advertising Cycling to Manage Exclusivity Loss in Fashion Styles11
On Finite Adaptability in Two-Stage Distributionally Robust Optimization11
Quantile Markov Decision Processes11
Who Is Next: Patient Prioritization Under Emergency Department Blocking11
A Strongly Polynomial Algorithm for Linear Exchange Markets10
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management10
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation10
Spatio-Temporal Pricing for Ridesharing Platforms10
Testing, Voluntary Social Distancing, and the Spread of an Infection10
A Token-Based Central Queue with Order-Independent Service Rates10
Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management10
In This Issue10
Exploiting Random Lead Times for Significant Inventory Cost Savings10
Unit Commitment Without Commitment: A Dynamic Programming Approach for Managing an Integrated Energy System Under Uncertainty10
Utility Preference Robust Optimization with Moment-Type Information Structure10
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions10
Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees10
The Power of Adaptivity for Stochastic Submodular Cover10
Single Allocation Hub Location with Heterogeneous Economies of Scale10
Misinformation and Disinformation in Modern Warfare10
An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime10
Recovering Dantzig–Wolfe Bounds by Cutting Planes9
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design9
Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale9
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA9
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model9
Bayesian and Randomized Clock Auctions9
Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff9
Wasserstein Distributionally Robust Optimization and Variation Regularization9
Technical Note—Dynamic Mechanism Design with Capacity Constraint9
Robustness of Proactive Intensive Care Unit Transfer Policies9
Linear Classifiers Under Infinite Imbalance9
Search in the Dark: The Case with Recall and Gaussian Learning9
Static Pricing for Multi-unit Prophet Inequalities9
Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information9
Treatment Planning for Victims with Heterogeneous Time Sensitivities in Mass Casualty Incidents9
Efficient Resource Allocation Contracts to Reduce Adverse Events9
Technical Note—The Generalized Sethi Advertising Model9
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals9
In This Issue9
Optimization Formulations for Storage Devices with Disjoint Operating Modes9
Foresee the Next Line: Customer Strategies and Information Disclosure in Tandem Queues9
Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimization9
Uncertainty Quantification and Exploration for Reinforcement Learning9
In This Issue9
Ranking and Contextual Selection9
The Generalized c/μ Rule for Queues with Heterogeneous Server Pools8
Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions8
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation8
Mixed-Integer Optimization with Constraint Learning8
Customer Scheduling in Large Service Systems Under Model Uncertainty8
Technical Note—A Data-Driven Approach to Beating SAA Out of Sample8
Technical Note—Ranking Distributions When Only Means and Variances Are Known8
Iterative Collaborative Filtering for Sparse Matrix Estimation8
Editorial Board8
Sample and Computationally Efficient Stochastic Kriging in High Dimensions8
Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations8
Column-Randomized Linear Programs: Performance Guarantees and Applications8
An Optimal Control Framework for Online Job Scheduling with General Cost Functions8
Endogenous Inverse Demand Functions8
Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models8
Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models8
Technical Note—Online Hypergraph Matching with Delays8
Characterizing Rational Transplant Program Response to Outcome-Based Regulation8
Weighted Scoring Rules and Convex Risk Measures8
Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection8
Stochastic Localization Methods for Convex Discrete Optimization via Simulation8
Online Learning for Constrained Assortment Optimization Under Markov Chain Choice Model7
Online Planning in Nonstationary Environments7
Event-Triggered Bayesian Control Chart7
Strong Optimal Classification Trees7
0.1151750087738