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-09-01 to 2025-09-01.)
ArticleCitations
Editorial Board85
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach68
Scores for Multivariate Distributions and Level Sets60
Optimal Dynamic Momentum Strategies56
Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis52
Fast and Simple Solutions of Blotto Games51
Comparing Sequential Forecasters51
Community-Engaged School District Design: A Stream-Based Approach49
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints49
Editorial Board48
Change-Point Detection in Dynamic Networks with Missing Links45
Portfolio Selection, Periodic Evaluations and Risk Taking43
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks41
Technical Note—On Matrix Exponential Differentiation with Application to Weighted Sum Distributions40
Optimal Cash Management with Payables Finance38
Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution37
Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions37
Introduction: Special Issue Honoring Kenneth Arrow36
Side-Constrained Dynamic Traffic Equilibria35
Asymptotically Tight Bounds on the Optimal Pricing Strategy with Patient Customers35
Black-Box Acceleration of Monotone Convex Program Solvers35
Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets34
The Price of Fairness of Scheduling a Scarce Resource33
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems33
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints33
Fast Quantum Subroutines for the Simplex Method32
Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem32
Structural Estimation of Markov Decision Processes in High-Dimensional State Space with Finite-Time Guarantees30
Quality Selection in Two-Sided Markets: A Constrained Price Discrimination Approach29
Optimal Learning Under Robustness and Time-Consistency29
Network Revenue Management Under a Spiked Multinomial Logit Choice Model29
Package Bids in Combinatorial Electricity Auctions: Selection, Welfare Losses, and Alternatives28
Editorial Board28
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds27
Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds27
Deepest Cuts for Benders Decomposition26
Adversarial Patrolling in a Uniform26
Data-Driven Ranking and Selection Under Input Uncertainty26
On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment26
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders26
Does the Prohibition of Trade-Through Hurt Liquidity Demanders?26
Optimal Regularized Online Allocation by Adaptive Re-Solving26
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems25
Efficient Learning for Clustering and Optimizing Context-Dependent Designs25
First-Stage Sampling in Ranking and Selection: Beyond Variance Estimation25
Modeling the Risk in Mortality Projections24
In This Apportionment Lottery, the House Always Wins24
Editorial Board24
Asymptotic Optimality of Semi-Open-Loop Policies in Markov Decision Processes with Large Lead Times24
A Stationary Mean-Field Equilibrium Model of Irreversible Investment in a Two-Regime Economy23
Production Planning with Risk Hedging Under a Conditional Value at Risk Objective23
In This Issue22
Jointly Modeling and Clustering Tensors in High Dimensions22
In This Issue22
Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays22
Enhanced Balancing of Bias-Variance Tradeoff in Stochastic Estimation: A Minimax Perspective21
Stochastic Knapsack Revisited: The Service Level Perspective21
Optimizing the Path Towards Plastic-Free Oceans21
Robust Queue Inference from Waiting Times21
A First-Order Approach to Accelerated Value Iteration21
Exit Spirals in Coupled Networked Markets21
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem19
A Planner-Trader Decomposition for Multimarket Hydro Scheduling19
Gradient-Based Algorithms for Convex Discrete Optimization via Simulation19
Monetizing Positive Externalities to Mitigate the Infrastructure Underinvestment Problem19
On Solving a Class of Continuous Traffic Equilibrium Problems and Planning Facility Location Under Congestion18
Technical Note—Greedy Algorithm for Multiway Matching with Bounded Regret18
A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce18
Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes18
Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing18
Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs18
Statistical Inference for Aggregation of Malmquist Productivity Indices18
Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs18
The Gatekeeper’s Dilemma: “When Should I Transfer This Customer?”18
Dynamic Pricing and Matching for Two-Sided Queues18
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming17
Political Districting to Minimize County Splits17
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems17
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence17
Computing Constrained Shortest-Paths at Scale17
To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment17
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities17
Editorial Board17
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings17
Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach17
Market Making and Incentives Design in the Presence of a Dark Pool: A Stackelberg Actor–Critic Approach17
Consistency Cuts for Dantzig-Wolfe Reformulations16
Smoothness-Adaptive Contextual Bandits16
Hard and Soft Defense Against a Sequence of Aerial Threats16
Is Your Price Personalized? Alleviating Customer Concerns with Inventory Availability Information16
The Analytics of Bed Shortages: Coherent Metric, Prediction, and Optimization16
Spectral Ranking Inferences Based on General Multiway Comparisons16
Dual-Directed Algorithm Design for Efficient Pure Exploration16
Learning Product Rankings Robust to Fake Users16
E-Commerce Order Fulfillment Problem with Limited Time Window16
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis15
Binary Diversification Characterizes Exact Capacities15
Technical Note: Multistage Robust Mixed-Integer Programming15
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models15
Minimax Optimal Estimation of Stability Under Distribution Shift15
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation15
Optimal Pricing and Introduction Timing of Technology Upgrades in Subscription-Based Services14
Optimal Investment, Heterogeneous Consumption, and Best Time for Retirement14
Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator14
Optimal No-Regret Learning in Repeated First-Price Auctions14
Data Aggregation and Demand Prediction14
Early Reservation for Follow-up Appointments in a Slotted-Service Queue14
A Pareto Dominance Principle for Data-Driven Optimization14
1.79-Approximation Algorithms for Continuous Review Single-Sourcing Lost-Sales and Dual-Sourcing Inventory Models14
Pooling Agents for Customer-Intensive Services14
Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls13
Selection of the Most Probable Best13
Inventory Sharing for Perishable Products: Application to Platelet Inventory Management in Hospital Blood Banks13
Data-Driven Minimax Optimization with Expectation Constraints13
Harvesting Solar Power Foments Prices in a Vicious Cycle: Breaking the Cycle with Price Mechanisms13
The Fragility of Optimized Bandit Algorithms13
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching13
Distributionally Robust Optimization Under Distorted Expectations13
Infinite-Dimensional Fisher Markets and Tractable Fair Division13
A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation13
Calibration of Distributionally Robust Empirical Optimization Models13
Systemic Risk-Driven Portfolio Selection13
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity13
Contextual Search in the Presence of Adversarial Corruptions13
Rate-Optimal Online Learning for Dynamic Assortment Selection with Positioning13
Axiomatizing the Bayesian Paradigm in Parallel Small Worlds12
Distributionally Robust Linear and Discrete Optimization with Marginals12
The Value of Coordination in Multimarket Bidding of Grid Energy Storage12
Technical Note—Capacitated Assortment Optimization: Hardness and Approximation12
Fast Core Pricing for Rich Advertising Auctions12
Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback12
On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs12
Single-Product Assemble-to-Order Systems with Exogenous Lead Times12
Optimal Sequential Multiclass Diagnosis12
Robust Assortment Optimization Under the Markov Chain Choice Model12
Optimal Auction Design with Deferred Inspection and Reward12
Establishing Convergence of Infinite-Server Queues with Batch Arrivals to Shot-Noise Processes12
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria12
Subsampling to Enhance Efficiency in Input Uncertainty Quantification12
Shortest-Job-First Scheduling in Many-Server Queues with Impatient Customers and Noisy Service-Time Estimates12
A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity12
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback12
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem12
New Venture Creation: A Drift-Variance Diffusion Control Model11
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides11
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements11
When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence11
The Anchor-Robust Project Scheduling Problem11
Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games11
Dual Moments and Risk Attitudes11
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs11
Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms11
Lagrangian Inference for Ranking Problems11
“Now or Later?” When to Deploy Qualification Screening in Open-Bid Auction for Re-Sourcing11
Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems11
Persuading Risk-Conscious Agents: A Geometric Approach11
Need for Speed: The Impact of In-Process Delays on Customer Behavior in Online Retail11
Load Balancing Using Sparse Communication11
Always Valid Inference: Continuous Monitoring of A/B Tests10
Editorial Board10
Detecting Bots and Assessing Their Impact in Social Networks10
Scalable Reinforcement Learning for Multiagent Networked Systems10
Advertising Cycling to Manage Exclusivity Loss in Fashion Styles10
Naive Learning Through Probability Overmatching10
Reliable Off-Policy Evaluation for Reinforcement Learning10
Process Flexibility: A Distribution-Free Approach to Long Chain Resilience10
Who Is Next: Patient Prioritization Under Emergency Department Blocking10
Quantile Markov Decision Processes10
Building a Location-Based Set of Social Media Users10
Market Efficient Portfolios in a Systemic Economy10
Technical Note—Approximating Systems Fed by Poisson Processes with Rapidly Changing Arrival Rates10
Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics10
Learning to Schedule in Multiclass Many-Server Queues with Abandonment10
Revenue Management of a Professional Services Firm with Quality Revelation10
Regularized Aggregation of One-Off Probability Predictions10
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management10
Single Allocation Hub Location with Heterogeneous Economies of Scale10
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators10
Testing, Voluntary Social Distancing, and the Spread of an Infection9
Robustness of Proactive Intensive Care Unit Transfer Policies9
A Token-Based Central Queue with Order-Independent Service Rates9
Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees9
Technical Note—The Generalized Sethi Advertising Model9
An ADMM-Based Distributed Optimization Method for Solving Security-Constrained Alternating Current Optimal Power Flow9
Dynamic Stochastic Matching Under Limited Time9
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation9
An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime9
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design9
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions9
A Strongly Polynomial Algorithm for Linear Exchange Markets9
Recovering Dantzig–Wolfe Bounds by Cutting Planes9
Many-Server Queueing Systems with Heterogeneous Strategic Servers in Heavy Traffic9
On Finite Adaptability in Two-Stage Distributionally Robust Optimization9
Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management9
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals9
In This Issue9
Integrated Ad Delivery Planning for Targeted Display Advertising9
In This Issue9
M-Convexity and Its Applications in Operations9
The Power of Adaptivity for Stochastic Submodular Cover9
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation8
Technical Note—Dynamic Mechanism Design with Capacity Constraint8
Wasserstein Distributionally Robust Optimization and Variation Regularization8
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA8
Efficient Resource Allocation Contracts to Reduce Adverse Events8
Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff8
Optimization Formulations for Storage Devices with Disjoint Operating Modes8
Utility Preference Robust Optimization with Moment-Type Information Structure8
Ranking and Contextual Selection8
Spatio-Temporal Pricing for Ridesharing Platforms8
Exploiting Random Lead Times for Significant Inventory Cost Savings8
Sample and Computationally Efficient Stochastic Kriging in High Dimensions8
Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimization8
Linear Classifiers Under Infinite Imbalance8
Search in the Dark: The Case with Recall and Gaussian Learning8
In This Issue8
Misinformation and Disinformation in Modern Warfare8
Timing It Right: Balancing Inpatient Congestion vs. Readmission Risk at Discharge8
Unit Commitment Without Commitment: A Dynamic Programming Approach for Managing an Integrated Energy System Under Uncertainty8
Uncertainty Quantification and Exploration for Reinforcement Learning8
Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information8
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model8
Static Pricing for Multi-unit Prophet Inequalities8
Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations7
Matching Impatient and Heterogeneous Demand and Supply7
Treatment Planning for Victims with Heterogeneous Time Sensitivities in Mass Casualty Incidents7
Bayesian and Randomized Clock Auctions7
An Optimal Control Framework for Online Job Scheduling with General Cost Functions7
Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models7
Technical Note—Online Hypergraph Matching with Delays7
Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection7
Characterizing Rational Transplant Program Response to Outcome-Based Regulation7
Stochastic Localization Methods for Convex Discrete Optimization via Simulation7
Instrumenting While Experimenting: An Empirical Method for Competitive Pricing at Scale7
Mixed-Integer Optimization with Constraint Learning7
Technical Note—A Data-Driven Approach to Beating SAA Out of Sample7
Iterative Collaborative Filtering for Sparse Matrix Estimation7
Customer Scheduling in Large Service Systems Under Model Uncertainty7
The Generalized c/μ Rule for Queues with Heterogeneous Server Pools7
Combined Custom Hedging: Optimal Design, Noninsurable Exposure, and Operational Risk Management7
Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions7
Endogenous Inverse Demand Functions7
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation7
Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models7
Editorial Board7
The Strategic Benefit of Request for Proposal/Quotation7
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem7
Technical Note—Ranking Distributions When Only Means and Variances Are Known7
Column-Randomized Linear Programs: Performance Guarantees and Applications7
Weighted Scoring Rules and Convex Risk Measures7
0.096427917480469