Operations Research Letters

Papers
(The TQCC of Operations Research Letters is 2. 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-03-01 to 2025-03-01.)
ArticleCitations
Age-based Markovian approximation of the G/M/1 queue56
Editorial Board25
Strategic inattention of multi-product firms with free entry20
Bounds on revenue for the random consideration set choice model19
Editorial Board17
Editorial Board16
On upper bounds for the multiple knapsack assignment problem13
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations11
Editorial Board11
Computing the worst-case due dates violations with budget uncertainty10
On the complexity of scheduling unrelated parallel machines with limited preemptions10
Freight consolidation through carrier collaboration - A cooperative game10
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate10
Business models for public emission reduction projects9
Combined pricing and inventory control with multiple unreliable suppliers9
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates9
Differential game approach to pricing and advertising decisions9
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem8
A simplified completely positive reformulation for binary quadratic programs8
A randomized algorithm for online metric b-matching8
Approximating Nash equilibrium for production control with sticky price8
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case8
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion7
Efficient sampling from phase-type distributions7
Detecting stock market regimes from option prices7
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing7
The principle of optimality in dynamic programming: A pedagogical note7
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope6
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments6
On the number of tests needed for the pooled testing halving scheme6
When “Better” is better than “Best”6
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization6
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations6
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis6
A refined analysis of submodular Greedy6
On BASTA for discrete-time queues6
Approximate performance measures for a single station two-stage reneging queue6
The secretary problem with multiple job vacancies and batch candidate arrivals6
A queueing model for customer rescheduling and no-shows in service systems5
On the optimal design of the randomized unbiased Monte Carlo estimators5
On the minimal displacement vector of the Douglas–Rachford operator5
A short proof of convexity of step-out–step-in sequencing games5
Non-nested estimators for the central moments of a conditional expectation and their convergence properties5
Nonparametric identification and estimation of score auctions in multi-attribute procurement5
Envy-free matchings with one-sided preferences and matroid constraints5
Direct solution of the normal equations in interior point methods for convex transportation problems5
A many-server functional strong law for a non-stationary loss model5
New results on multi-dimensional linear discriminant analysis5
A decomposition method for solving multicommodity network equilibria5
Discrete multi-module capacitated lot-sizing problems with multiple items5
Assortment optimization with repeated exposures and product-dependent patience cost5
Single machine robust scheduling with budgeted uncertainty5
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier5
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable5
Generalised 2-circulant inequalities for the max-cut problem5
Approximation algorithm for the stochastic prize-collecting set multicover problem4
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation4
Performance bound for myopic order-up-to inventory policies under stationary demand processes4
Gradients and subgradients of buffered failure probability4
Communication-aware scheduling of precedence-constrained tasks on related machines4
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system4
Lower bound on size of branch-and-bound trees for solving lot-sizing problem4
Computing a common prior4
Comparing the costs of Any Fit algorithms for bin packing4
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]4
Computable error bounds of multidimensional Euler inversion and their financial applications3
On the complexity of surrogate and group relaxation for integer linear programs3
Point and interval estimation of decomposition error in discrete-time open tandem queues3
The bipartite travelling salesman problem: A pyramidally solvable case3
Best arm identification in generalized linear bandits3
Fairness in accessibility of public service facilities3
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands3
A robust approach for modeling limited observability in bilevel optimization3
Convergence analysis of a subsampled Levenberg-Marquardt algorithm3
Optimal switching policy for batch servers3
Asymptotics for the survival probability of time-inhomogeneous diffusion processes3
Editorial Board3
Bidding to procure supply in newsvendor networks3
Diffusion-level universality of many-server systems with concurrent service3
Editorial Board3
Hedging-based utility risk measure customized for individual investors3
Gearhart–Koshy acceleration for affine subspaces3
Incentive-compatible cost allocations for inventory games with private information3
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming3
An option pricing model with double-exponential jumps in returns and GARCH diffusion in volatilities3
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs3
Data-driven hedging of stock index options via deep learning3
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number3
Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects3
On the many-server fluid limit for a service system with routing based on delayed information3
Editorial Board3
Recursive calculation of moments in priority queues3
Continuous cutting plane algorithms in integer programming3
A comparison study on responsiveness of three mechanisms to affirmative action in school choice3
Break maximization for round-robin tournaments without consecutive breaks3
Nash equilibria of quasisupermodular games3
Evaluating mixed-integer programming models over multiple right-hand sides3
Optimal transport divergences induced by scoring functions3
The non-Markovian nature of nested logit choice3
Some more subclasses of Q-matrix3
Editorial Board3
Asymptotic probability of majority inversion under a general binomial voting model3
Data-driven preventive maintenance for a heterogeneous machine portfolio2
A random arrival rule for airport problems with fuzzy costs2
CABRA: Clustering algorithm based on regular arrangement2
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2
WaveCorr: Deep reinforcement learning with permutation invariant convolutional policy networks for portfolio management2
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds2
Editorial Board2
SPT optimality (mostly) via linear programming2
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP2
Online minimum matching with uniform metric and random arrivals2
Complexity of Source-Sink Monotone 2-parameter min cut2
Can partial cooperation between developed and developing countries be stable?2
Sequential convergence of AdaGrad algorithm for smooth convex optimization2
Nonparametric data-driven learning algorithms for multilocation inventory systems2
Population monotonic allocation schemes for the two-period economic lot-sizing games2
A bargaining game for implementing the equal gain splitting rule in sequencing situations2
The effect of information on queue-scalping service systems2
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization2
Strategic revenue management of preemptive versus non-preemptive queues2
On the equivalence of the Boston and top trading cycles school choice mechanisms2
A novel stepsize for gradient descent method2
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes2
Envy-free house allocation with minimum subsidy2
On the long-only minimum variance portfolio under single factor model2
Reducibility bounds of objective functions over the integers2
Saturating stable matchings2
On robustness in nonconvex optimization with application to defense planning2
Condition-based maintenance optimization based on matrix algebra2
Orthogonal schedules in single round robin tournaments2
Can loss aversion explain sourcing diversification under supply risk?2
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains2
Editorial Board2
Ellipsoidal classification via semidefinite programming2
Egalitarian allocation and players of certain type2
Implied volatility slopes and jumps in bitcoin options market2
Structured pruning of neural networks for constraints learning2
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure2
Optimal performance of parallel-server systems with job size prediction errors2
Ergodic inventory control with diffusion demand and general ordering costs2
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables2
Lose oneself in comparison: An investment and consumption game between two agents2
Cascading failures in the global financial system: A dynamical model2
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem2
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem2
Negative prices in network pricing games2
Faster algorithm and sharper analysis for constrained Markov decision process2
Erratum to “Two dimensional maximum weight matching using Manhattan topology” [Oper. Res. Lett. 50 (3) (2022) 281–286]2
Uncertainty reduction in robust optimization2
Near-optimal Nonlinear Regression Trees2
On semidefinite descriptions for convex hulls of quadratic programs2
Perov's contraction principle and dynamic programming with stochastic discounting2
Online learning for route planning with on-time arrival reliability2
Complete rent dissipation in contest with power technologies2
Strengthened clique-family inequalities for the stable set polytope2
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function2
Towards optimal running times for optimal transport2
A novel approach to Hölder continuity of a class of parametric variational–hemivariational inequalities2
A greedy algorithm for finding maximum spanning trees in infinite graphs2
On the optimality of a maintenance queueing system2
Convex optimization under combinatorial sparsity constraints2
Primal separation and approximation for the {0,1/2}-closure2
0.1553680896759