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 2021-11-01 to 2025-11-01.)
ArticleCitations
Editorial Board91
Scores for Multivariate Distributions and Level Sets68
Editorial Board65
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems60
Change-Point Detection in Dynamic Networks with Missing Links58
Community-Engaged School District Design: A Stream-Based Approach57
Comparing Sequential Forecasters56
Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis48
Portfolio Selection, Periodic Evaluations and Risk Taking47
Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions46
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks46
Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution43
Introduction: Special Issue Honoring Kenneth Arrow41
Black-Box Acceleration of Monotone Convex Program Solvers40
Side-Constrained Dynamic Traffic Equilibria39
Asymptotically Tight Bounds on the Optimal Pricing Strategy with Patient Customers39
Fast and Simple Solutions of Blotto Games38
Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets38
Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions37
Optimal Dynamic Momentum Strategies36
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach36
Optimal Cash Management with Payables Finance36
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints35
Fast Quantum Subroutines for the Simplex Method35
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints33
Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem32
Adversarial Patrolling in a Uniform31
On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment31
The Price of Fairness of Scheduling a Scarce Resource31
Package Bids in Combinatorial Electricity Auctions: Selection, Welfare Losses, and Alternatives30
Does the Prohibition of Trade-Through Hurt Liquidity Demanders?30
Quality Selection in Two-Sided Markets: A Constrained Price Discrimination Approach29
Editorial Board29
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders28
Optimal Regularized Online Allocation by Adaptive Re-Solving28
Structural Estimation of Markov Decision Processes in High-Dimensional State Space with Finite-Time Guarantees28
Optimal Learning Under Robustness and Time-Consistency28
Data-Driven Ranking and Selection Under Input Uncertainty28
Network Revenue Management Under a Spiked Multinomial Logit Choice Model28
First-Stage Sampling in Ranking and Selection: Beyond Variance Estimation27
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds27
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems27
Asymptotic Optimality of Semi-Open-Loop Policies in Markov Decision Processes with Large Lead Times26
In This Apportionment Lottery, the House Always Wins26
Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds26
Efficient Learning for Clustering and Optimizing Context-Dependent Designs26
Deepest Cuts for Benders Decomposition26
In This Issue26
Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes25
Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays24
Statistical Inference for Aggregation of Malmquist Productivity Indices24
A Stationary Mean-Field Equilibrium Model of Irreversible Investment in a Two-Regime Economy24
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem23
A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce23
Exit Spirals in Coupled Networked Markets23
Gradient-Based Algorithms for Convex Discrete Optimization via Simulation23
On Solving a Class of Continuous Traffic Equilibrium Problems and Planning Facility Location Under Congestion23
In This Issue22
Robust Queue Inference from Waiting Times22
Enhanced Balancing of Bias-Variance Tradeoff in Stochastic Estimation: A Minimax Perspective21
Optimizing the Path Towards Plastic-Free Oceans21
A First-Order Approach to Accelerated Value Iteration21
Stochastic Knapsack Revisited: The Service Level Perspective21
The Gatekeeper’s Dilemma: “When Should I Transfer This Customer?”20
Dynamic Pricing and Matching for Two-Sided Queues20
Near-Optimal Pricing and Resource Allocation in a Large-Scale Service System20
A Planner-Trader Decomposition for Multimarket Hydro Scheduling20
Jointly Modeling and Clustering Tensors in High Dimensions20
Technical Note—Greedy Algorithm for Multiway Matching with Bounded Regret20
Monetizing Positive Externalities to Mitigate the Infrastructure Underinvestment Problem20
Modeling the Risk in Mortality Projections20
Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing20
Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs19
Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs19
Editorial Board19
Production Planning with Risk Hedging Under a Conditional Value at Risk Objective19
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming18
Computing Constrained Shortest-Paths at Scale18
To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment18
Is Your Price Personalized? Alleviating Customer Concerns with Inventory Availability Information18
Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach18
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence18
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems18
Political Districting to Minimize County Splits18
Optimal No-Regret Learning in Repeated First-Price Auctions18
E-Commerce Order Fulfillment Problem with Limited Time Window17
Technical Note: Multistage Robust Mixed-Integer Programming17
Smoothness-Adaptive Contextual Bandits17
Spectral Ranking Inferences Based on General Multiway Comparisons17
Minimax Optimal Estimation of Stability Under Distribution Shift17
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis17
Dual-Directed Algorithm Design for Efficient Pure Exploration17
Hard and Soft Defense Against a Sequence of Aerial Threats17
Consistency Cuts for Dantzig-Wolfe Reformulations17
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities16
The Analytics of Bed Shortages: Coherent Metric, Prediction, and Optimization16
Optimal Pricing and Introduction Timing of Technology Upgrades in Subscription-Based Services16
Data Aggregation and Demand Prediction16
Binary Diversification Characterizes Exact Capacities16
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings15
Market Making and Incentives Design in the Presence of a Dark Pool: A Stackelberg Actor–Critic Approach15
1.79-Approximation Algorithms for Continuous Review Single-Sourcing Lost-Sales and Dual-Sourcing Inventory Models15
A Pareto Dominance Principle for Data-Driven Optimization15
Learning Product Rankings Robust to Fake Users15
Distributionally Robust Optimization Under Distorted Expectations15
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching15
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models15
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation15
Early Reservation for Follow-up Appointments in a Slotted-Service Queue15
The Fragility of Optimized Bandit Algorithms14
Pooling Agents for Customer-Intensive Services14
Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator14
Systemic Risk-Driven Portfolio Selection14
Selection of the Most Probable Best14
A Data-Driven Approach to Improve Artisans’ Productivity in Distributed Supply Chains14
Inventory Sharing for Perishable Products: Application to Platelet Inventory Management in Hospital Blood Banks14
Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement14
Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls14
Shortest-Job-First Scheduling in Many-Server Queues with Impatient Customers and Noisy Service-Time Estimates13
Infinite-Dimensional Fisher Markets and Tractable Fair Division13
Contextual Search in the Presence of Adversarial Corruptions13
Data-Driven Minimax Optimization with Expectation Constraints13
Axiomatizing the Bayesian Paradigm in Parallel Small Worlds13
Single-Product Assemble-to-Order Systems with Exogenous Lead Times13
Distributionally Robust Linear and Discrete Optimization with Marginals13
Subsampling to Enhance Efficiency in Input Uncertainty Quantification13
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity13
Rate-Optimal Online Learning for Dynamic Assortment Selection with Positioning13
Harvesting Solar Power Foments Prices in a Vicious Cycle: Breaking the Cycle with Price Mechanisms13
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria13
Optimal Sequential Multiclass Diagnosis13
A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation13
On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs13
The Value of Coordination in Multimarket Bidding of Grid Energy Storage13
Optimal Auction Design with Deferred Inspection and Reward12
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
“Now or Later?” When to Deploy Qualification Screening in Open-Bid Auction for Re-Sourcing12
Scalable Reinforcement Learning for Multiagent Networked Systems12
Dual Moments and Risk Attitudes12
Establishing Convergence of Infinite-Server Queues with Batch Arrivals to Shot-Noise Processes12
Process Flexibility: A Distribution-Free Approach to Long Chain Resilience12
Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems12
The Anchor-Robust Project Scheduling Problem12
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements12
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides12
Persuading Risk-Conscious Agents: A Geometric Approach12
Learning to Schedule in Multiclass Many-Server Queues with Abandonment12
Fast Core Pricing for Rich Advertising Auctions12
Load Balancing Using Sparse Communication12
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation12
Regularized Aggregation of One-Off Probability Predictions11
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management11
Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms11
Lagrangian Inference for Ranking Problems11
Always Valid Inference: Continuous Monitoring of A/B Tests11
Many-Server Queueing Systems with Heterogeneous Strategic Servers in Heavy Traffic11
Advertising Cycling to Manage Exclusivity Loss in Fashion Styles11
Market Efficient Portfolios in a Systemic Economy11
Robust Assortment Optimization Under the Markov Chain Choice Model11
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs11
A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity11
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem11
Editorial Board11
Reliable Off-Policy Evaluation for Reinforcement Learning11
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators11
When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence11
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback11
Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games11
Need for Speed: The Impact of In-Process Delays on Customer Behavior in Online Retail11
Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees10
Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics10
Technical Note—The Generalized Sethi Advertising Model10
Quantile Markov Decision Processes10
Naive Learning Through Probability Overmatching10
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation10
In This Issue10
Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management10
Ranking and Contextual Selection10
A Token-Based Central Queue with Order-Independent Service Rates10
On Finite Adaptability in Two-Stage Distributionally Robust Optimization10
An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow10
Revenue Management of a Professional Services Firm with Quality Revelation10
Dynamic Stochastic Matching Under Limited Time10
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions10
Detecting Bots and Assessing Their Impact in Social Networks10
Utility Preference Robust Optimization with Moment-Type Information Structure10
Building a Location-Based Set of Social Media Users10
Single Allocation Hub Location with Heterogeneous Economies of Scale10
Who Is Next: Patient Prioritization Under Emergency Department Blocking10
The Power of Adaptivity for Stochastic Submodular Cover10
Testing, Voluntary Social Distancing, and the Spread of an Infection10
Technical Note—Dynamic Mechanism Design with Capacity Constraint9
Misinformation and Disinformation in Modern Warfare9
Unit Commitment Without Commitment: A Dynamic Programming Approach for Managing an Integrated Energy System Under Uncertainty9
In This Issue9
Efficient Resource Allocation Contracts to Reduce Adverse Events9
A Strongly Polynomial Algorithm for Linear Exchange Markets9
Robustness of Proactive Intensive Care Unit Transfer Policies9
Recovering Dantzig–Wolfe Bounds by Cutting Planes9
An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime9
Spatio-Temporal Pricing for Ridesharing Platforms9
Static Pricing for Multi-unit Prophet Inequalities9
Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff9
In This Issue9
Exploiting Random Lead Times for Significant Inventory Cost Savings9
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals9
Wasserstein Distributionally Robust Optimization and Variation Regularization9
Timing It Right: Balancing Inpatient Congestion vs. Readmission Risk at Discharge9
Uncertainty Quantification and Exploration for Reinforcement Learning9
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation9
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design9
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA8
Linear Classifiers Under Infinite Imbalance8
Bayesian and Randomized Clock Auctions8
Optimization Formulations for Storage Devices with Disjoint Operating Modes8
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation8
Editorial Board8
Technical Note—Data-Driven Profit Estimation Error in the Newsvendor Model8
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem8
Iterative Collaborative Filtering for Sparse Matrix Estimation8
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model8
Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information8
Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale8
Mixed-Integer Optimization with Constraint Learning8
Technical Note—Online Hypergraph Matching with Delays8
Weighted Scoring Rules and Convex Risk Measures8
Technical Note—Cloud Cost Optimization: Model, Bounds, and Asymptotics8
Stochastic Localization Methods for Convex Discrete Optimization via Simulation8
Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models8
Treatment Planning for Victims with Heterogeneous Time Sensitivities in Mass Casualty Incidents8
Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimization8
Sample and Computationally Efficient Stochastic Kriging in High Dimensions8
Search in the Dark: The Case with Recall and Gaussian Learning8
Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models8
Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions8
Column-Randomized Linear Programs: Performance Guarantees and Applications8
Customer Scheduling in Large Service Systems Under Model Uncertainty8
The Generalized c/μ Rule for Queues with Heterogeneous Server Pools8
Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations8
In This Issue7
Technical Note—On the Convergence Rate of Stochastic Approximation for Gradient-Based Stochastic Optimization7
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents7
Online Planning in Nonstationary Environments7
Event-Triggered Bayesian Control Chart7
Online Learning for Constrained Assortment Optimization Under Markov Chain Choice Model7
A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves7
Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments7
Technical Note–Dynamic Duopolistic Competition with Sticky Prices7
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints7
1.5645270347595