Operations Research

Papers
(The median citation count of Operations Research is 3. 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-06-01 to 2025-06-01.)
ArticleCitations
Editorial Board69
In This Issue61
Change-Point Detection in Dynamic Networks with Missing Links56
The Price of Fairness of Scheduling a Scarce Resource54
Community-Engaged School District Design: A Stream-Based Approach48
Scores for Multivariate Distributions and Level Sets45
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints43
Comparing Sequential Forecasters43
Portfolio Selection, Periodic Evaluations and Risk Taking42
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks42
Optimal Dynamic Momentum Strategies39
Optimal Cash Management with Payables Finance37
Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions37
Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution34
Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions34
Introduction: Special Issue Honoring Kenneth Arrow34
Fast Quantum Subroutines for the Simplex Method33
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach33
Black-Box Acceleration of Monotone Convex Program Solvers33
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints32
Asymptotically Tight Bounds on the Optimal Pricing Strategy with Patient Customers32
Side-Constrained Dynamic Traffic Equilibria32
Fast and Simple Solutions of Blotto Games30
Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets30
Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem30
Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis29
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems28
First-Stage Sampling in Ranking and Selection: Beyond Variance Estimation27
Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds26
Editorial Board26
Data-Driven Ranking and Selection Under Input Uncertainty25
Efficient Learning for Clustering and Optimizing Context-Dependent Designs25
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems25
On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment25
Structural Estimation of Markov Decision Processes in High-Dimensional State Space with Finite-Time Guarantees24
Optimal Regularized Online Allocation by Adaptive Re-Solving24
Quality Selection in Two-Sided Markets: A Constrained Price Discrimination Approach24
Optimal Learning Under Robustness and Time-Consistency24
Technical Note—Consumer Choice and Market Expansion: Modeling, Optimization, and Estimation23
Adversarial Patrolling in a Uniform23
Deepest Cuts for Benders Decomposition23
Does the Prohibition of Trade-Through Hurt Liquidity Demanders?23
Network Revenue Management Under a Spiked Multinomial Logit Choice Model22
In This Issue22
Editorial Board22
In This Issue22
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds22
In This Apportionment Lottery, the House Always Wins22
Dynamic Pricing and Matching for Two-Sided Queues21
A Stationary Mean-Field Equilibrium Model of Irreversible Investment in a Two-Regime Economy21
Robust Queue Inference from Waiting Times20
Modeling the Risk in Mortality Projections20
Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs20
Gradient-Based Algorithms for Convex Discrete Optimization via Simulation19
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem19
Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing19
A First-Order Approach to Accelerated Value Iteration19
Enhanced Balancing of Bias-Variance Tradeoff in Stochastic Estimation: A Minimax Perspective19
Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs18
Exit Spirals in Coupled Networked Markets18
Stochastic Knapsack Revisited: The Service Level Perspective18
Asymptotic Optimality of Semi-Open-Loop Policies in Markov Decision Processes with Large Lead Times18
Production Planning with Risk Hedging Under a Conditional Value at Risk Objective18
The Gatekeeper’s Dilemma: “When Should I Transfer This Customer?”18
Monetizing Positive Externalities to Mitigate the Infrastructure Underinvestment Problem18
A Planner-Trader Decomposition for Multimarket Hydro Scheduling18
On Solving a Class of Continuous Traffic Equilibrium Problems and Planning Facility Location Under Congestion18
On a Deterministic Approximation of Inventory Systems with Sequential Service-Level Constraints17
Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes17
Technical Note—Greedy Algorithm for Multiway Matching with Bounded Regret17
Jointly Modeling and Clustering Tensors in High Dimensions17
Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays17
Technical Note—Dynamic Data-Driven Estimation of Nonparametric Choice Models17
Editorial Board16
Optimizing the Path Towards Plastic-Free Oceans16
Binary Diversification Characterizes Exact Capacities16
Optimal Control of Partially Observable Semi-Markovian Failing Systems: An Analysis Using a Phase Methodology16
Technical Note: Multistage Robust Mixed-Integer Programming16
A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce16
Statistical Inference for Aggregation of Malmquist Productivity Indices16
Computing Constrained Shortest-Paths at Scale15
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models15
Political Districting to Minimize County Splits15
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming15
Consistency Cuts for Dantzig-Wolfe Reformulations15
Optimal Pricing and Introduction Timing of Technology Upgrades in Subscription-Based Services15
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings15
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis15
Hard and Soft Defense Against a Sequence of Aerial Threats15
To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment15
Minimax Optimal Estimation of Stability Under Distribution Shift15
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence14
Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach14
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities14
Learning Product Rankings Robust to Fake Users14
Data Aggregation and Demand Prediction14
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems14
Smoothness-Adaptive Contextual Bandits14
The Analytics of Bed Shortages: Coherent Metric, Prediction, and Optimization14
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation13
The Fragility of Optimized Bandit Algorithms13
Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator13
Time Consistency of the Mean-Risk Problem13
Market Making and Incentives Design in the Presence of a Dark Pool: A Stackelberg Actor–Critic Approach13
Selection of the Most Probable Best13
Early Reservation for Follow-up Appointments in a Slotted-Service Queue13
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching13
A Pareto Dominance Principle for Data-Driven Optimization13
Optimal No-Regret Learning in Repeated First-Price Auctions13
Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement13
1.79-Approximation Algorithms for Continuous Review Single-Sourcing Lost-Sales and Dual-Sourcing Inventory Models13
Infinite-Dimensional Fisher Markets and Tractable Fair Division12
Harvesting Solar Power Foments Prices in a Vicious Cycle: Breaking the Cycle with Price Mechanisms12
Axiomatizing the Bayesian Paradigm in Parallel Small Worlds12
Transmission Capacity Allocation in Zonal Electricity Markets12
Calibration of Distributionally Robust Empirical Optimization Models12
Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls12
Contextual Search in the Presence of Adversarial Corruptions12
A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation12
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria12
Inventory Sharing for Perishable Products: Application to Platelet Inventory Management in Hospital Blood Banks12
Systemic Risk-Driven Portfolio Selection12
Shortest-Job-First Scheduling in Many-Server Queues with Impatient Customers and Noisy Service-Time Estimates12
Subsampling to Enhance Efficiency in Input Uncertainty Quantification12
Single-Product Assemble-to-Order Systems with Exogenous Lead Times12
Pooling Agents for Customer-Intensive Services12
Distributionally Robust Optimization Under Distorted Expectations12
The Value of Coordination in Multimarket Bidding of Grid Energy Storage11
Distributionally Robust Linear and Discrete Optimization with Marginals11
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements11
On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs11
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity11
Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms11
A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity11
Inventory Integration with Rational Consumers11
Data-Driven Minimax Optimization with Expectation Constraints11
Establishing Convergence of Infinite-Server Queues with Batch Arrivals to Shot-Noise Processes11
Robust Assortment Optimization Under the Markov Chain Choice Model11
“Now or Later?” When to Deploy Qualification Screening in Open-Bid Auction for Re-Sourcing10
Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems10
Scalable Reinforcement Learning for Multiagent Networked Systems10
Optimal Sequential Multiclass Diagnosis10
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides10
Need for Speed: The Impact of In-Process Delays on Customer Behavior in Online Retail10
When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence10
Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games10
Persuading Risk-Conscious Agents: A Geometric Approach10
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs10
Always Valid Inference: Continuous Monitoring of A/B Tests10
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback10
Lagrangian Inference for Ranking Problems10
New Venture Creation: A Drift-Variance Diffusion Control Model10
Dual Moments and Risk Attitudes10
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem10
Optimal Auction Design with Deferred Inspection and Reward10
Learning to Schedule in Multiclass Many-Server Queues with Abandonment10
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation9
The Anchor-Robust Project Scheduling Problem9
Detecting Bots and Assessing Their Impact in Social Networks9
Revenue Management of a Professional Services Firm with Quality Revelation9
Quantile Markov Decision Processes9
Naive Learning Through Probability Overmatching9
Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback9
Fast Core Pricing for Rich Advertising Auctions9
Reliable Off-Policy Evaluation for Reinforcement Learning9
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management9
Market Efficient Portfolios in a Systemic Economy9
Regularized Aggregation of One-Off Probability Predictions9
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation9
Editorial Board9
Building a Location-Based Set of Social Media Users9
Advertising Cycling to Manage Exclusivity Loss in Fashion Styles9
Single Allocation Hub Location with Heterogeneous Economies of Scale9
Technical Note—Approximating Systems Fed by Poisson Processes with Rapidly Changing Arrival Rates9
A Token-Based Central Queue with Order-Independent Service Rates8
Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management8
Robustness of Proactive Intensive Care Unit Transfer Policies8
In This Issue8
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators8
Dynamic Stochastic Matching Under Limited Time8
On Finite Adaptability in Two-Stage Distributionally Robust Optimization8
The Power of Adaptivity for Stochastic Submodular Cover8
Utility Preference Robust Optimization with Moment-Type Information Structure8
Technical Note—Dynamic Mechanism Design with Capacity Constraint8
Integrated Ad Delivery Planning for Targeted Display Advertising8
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions8
M-Convexity and Its Applications in Operations8
Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics8
Who Is Next: Patient Prioritization Under Emergency Department Blocking8
Technical Note—The Generalized Sethi Advertising Model8
Ranking and Contextual Selection8
A Strongly Polynomial Algorithm for Linear Exchange Markets8
Misinformation and Disinformation in Modern Warfare8
Unit Commitment Without Commitment: A Dynamic Programming Approach for Managing an Integrated Energy System Under Uncertainty8
Recovering Dantzig–Wolfe Bounds by Cutting Planes8
An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow8
Timing It Right: Balancing Inpatient Congestion vs. Readmission Risk at Discharge8
Static Pricing for Multi-unit Prophet Inequalities7
Search in the Dark: The Case with Recall and Gaussian Learning7
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation7
Uncertainty Quantification and Exploration for Reinforcement Learning7
Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models7
Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimization7
In This Issue7
Exploiting Random Lead Times for Significant Inventory Cost Savings7
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation7
Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees7
Treatment Planning for Victims with Heterogeneous Time Sensitivities in Mass Casualty Incidents7
Optimization Formulations for Storage Devices with Disjoint Operating Modes7
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA7
Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff7
Sample and Computationally Efficient Stochastic Kriging in High Dimensions7
Bayesian and Randomized Clock Auctions7
Testing, Voluntary Social Distancing, and the Spread of an Infection7
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design7
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals7
Spatio-Temporal Pricing for Ridesharing Platforms7
Efficient Resource Allocation Contracts to Reduce Adverse Events7
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model7
Linear Classifiers Under Infinite Imbalance7
Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information7
Mixed-Integer Optimization with Constraint Learning7
Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale7
Wasserstein Distributionally Robust Optimization and Variation Regularization7
An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime7
Editorial Board6
Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book Markets6
Vessel Service Planning in Seaports6
Technical Note: What’s in a Constraint? On the Ambiguity of Standard Delay Targets6
In This Issue6
Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection6
Column-Randomized Linear Programs: Performance Guarantees and Applications6
Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality6
Stochastic Localization Methods for Convex Discrete Optimization via Simulation6
Technical Note—A Data-Driven Approach to Beating SAA Out of Sample6
Characterizing Rational Transplant Program Response to Outcome-Based Regulation6
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents6
Technical Note: Dynamic Duopolistic Competition with Sticky Prices6
In This Issue6
Matching Impatient and Heterogeneous Demand and Supply6
Individualized Dynamic Patient Monitoring Under Alarm Fatigue6
Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models6
Technical Note—Online Hypergraph Matching with Delays6
The Strategic Benefit of Request for Proposal/Quotation6
Online Learning for Constrained Assortment Optimization Under Markov Chain Choice Model6
Learning to Persuade on the Fly: Robustness Against Ignorance6
Every Choice Function Is Pro-Con Rationalizable6
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards6
An Optimal Control Framework for Online Job Scheduling with General Cost Functions6
Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations6
0.46077489852905