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-02-01 to 2025-02-01.)
ArticleCitations
Age-based Markovian approximation of the G/M/1 queue53
A queueing model for customer rescheduling and no-shows in service systems21
The bipartite travelling salesman problem: A pyramidally solvable case20
Fairness in accessibility of public service facilities19
Computing a common prior16
Editorial Board15
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation13
Strategic inattention of multi-product firms with free entry11
Bounds on revenue for the random consideration set choice model10
Editorial Board10
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs9
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations9
On upper bounds for the multiple knapsack assignment problem9
Editorial Board9
Editorial Board9
Evaluating mixed-integer programming models over multiple right-hand sides8
A short proof of convexity of step-out–step-in sequencing games8
On the complexity of scheduling unrelated parallel machines with limited preemptions8
On the number of tests needed for the pooled testing halving scheme8
Gearhart–Koshy acceleration for affine subspaces8
Computing the worst-case due dates violations with budget uncertainty7
A many-server functional strong law for a non-stationary loss model7
Freight consolidation through carrier collaboration - A cooperative game7
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate7
On the minimal displacement vector of the Douglas–Rachford operator7
Combined pricing and inventory control with multiple unreliable suppliers7
Non-nested estimators for the central moments of a conditional expectation and their convergence properties6
A refined analysis of submodular Greedy6
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case6
Differential game approach to pricing and advertising decisions6
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates6
A randomized algorithm for online metric b-matching6
A decomposition method for solving multicommodity network equilibria6
Communication-aware scheduling of precedence-constrained tasks on related machines6
Envy-free matchings with one-sided preferences and matroid constraints6
Assortment optimization with repeated exposures and product-dependent patience cost5
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier5
Business models for public emission reduction projects5
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system5
Generalised 2-circulant inequalities for the max-cut problem5
Nonparametric identification and estimation of score auctions in multi-attribute procurement5
Approximating Nash equilibrium for production control with sticky price5
Lower bound on size of branch-and-bound trees for solving lot-sizing problem5
When “Better” is better than “Best”5
On the optimal design of the randomized unbiased Monte Carlo estimators5
New results on multi-dimensional linear discriminant analysis5
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming5
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem5
The secretary problem with multiple job vacancies and batch candidate arrivals4
A simplified completely positive reformulation for binary quadratic programs4
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands4
Gradients and subgradients of buffered failure probability4
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion4
Some more subclasses of Q-matrix4
A comparison study on responsiveness of three mechanisms to affirmative action in school choice4
Detecting stock market regimes from option prices4
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable4
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing4
Comparing the costs of Any Fit algorithms for bin packing4
Asymptotics for the survival probability of time-inhomogeneous diffusion processes4
Performance bound for myopic order-up-to inventory policies under stationary demand processes4
Discrete multi-module capacitated lot-sizing problems with multiple items4
Break maximization for round-robin tournaments without consecutive breaks3
Nash equilibria of quasisupermodular games3
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope3
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization3
A robust approach for modeling limited observability in bilevel optimization3
Efficient sampling from phase-type distributions3
Orthogonal schedules in single round robin tournaments3
Continuous cutting plane algorithms in integer programming3
Approximation algorithm for the stochastic prize-collecting set multicover problem3
Point and interval estimation of decomposition error in discrete-time open tandem queues3
Convergence analysis of a subsampled Levenberg-Marquardt algorithm3
Recursive calculation of moments in priority queues3
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]3
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments3
Optimal transport divergences induced by scoring functions3
Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects3
Best arm identification in generalized linear bandits3
Computable error bounds of multidimensional Euler inversion and their financial applications3
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations3
Hedging-based utility risk measure customized for individual investors3
Single machine robust scheduling with budgeted uncertainty3
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains3
Data-driven hedging of stock index options via deep learning3
A novel stepsize for gradient descent method3
Complete rent dissipation in contest with power technologies3
On BASTA for discrete-time queues3
The principle of optimality in dynamic programming: A pedagogical note3
Incentive-compatible cost allocations for inventory games with private information3
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis3
Convex optimization under combinatorial sparsity constraints3
Direct solution of the normal equations in interior point methods for convex transportation problems3
On the complexity of surrogate and group relaxation for integer linear programs3
Approximate performance measures for a single station two-stage reneging queue3
Population monotonic allocation schemes for the two-period economic lot-sizing games3
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP2
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables2
Ergodic inventory control with diffusion demand and general ordering costs2
On truthful constrained heterogeneous facility location with max-variant cost2
Erratum to “Two dimensional maximum weight matching using Manhattan topology” [Oper. Res. Lett. 50 (3) (2022) 281–286]2
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2
Complexity of Source-Sink Monotone 2-parameter min cut2
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem2
Editorial Board2
Weighted scoring rules for selecting a compatible committee2
Optimal switching policy for batch servers2
Strategic revenue management of preemptive versus non-preemptive queues2
Editorial Board2
A market-based approach for enabling inter-area reserve exchange2
A random arrival rule for airport problems with fuzzy costs2
Near-optimal Nonlinear Regression Trees2
Ellipsoidal classification via semidefinite programming2
On robustness in nonconvex optimization with application to defense planning2
WaveCorr: Deep reinforcement learning with permutation invariant convolutional policy networks for portfolio management2
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function2
Editorial Board2
Data-driven preventive maintenance for a heterogeneous machine portfolio2
Editorial Board2
A novel approach to Hölder continuity of a class of parametric variational–hemivariational inequalities2
On the optimality of a maintenance queueing system2
Envy-free house allocation with minimum subsidy2
SPT optimality (mostly) via linear programming2
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number2
Bidding to procure supply in newsvendor networks2
Towards optimal running times for optimal transport2
On the many-server fluid limit for a service system with routing based on delayed information2
On semidefinite descriptions for convex hulls of quadratic programs2
Asymptotic probability of majority inversion under a general binomial voting model2
Reducibility bounds of objective functions over the integers2
On the long-only minimum variance portfolio under single factor model2
Egalitarian allocation and players of certain type2
Negative prices in network pricing games2
Online minimum matching with uniform metric and random arrivals2
The non-Markovian nature of nested logit choice2
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization2
Saturating stable matchings2
A greedy algorithm for finding maximum spanning trees in infinite graphs2
Optimal performance of parallel-server systems with job size prediction errors2
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes2
Can partial cooperation between developed and developing countries be stable?2
Faster algorithm and sharper analysis for constrained Markov decision process2
Editorial Board2
Stochastic comparisons of lifetimes of series and parallel systems with dependent and heterogeneous components2
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure2
Lose oneself in comparison: An investment and consumption game between two agents2
The effect of information on queue-scalping service systems2
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds2
On the equivalence of the Boston and top trading cycles school choice mechanisms2
Perov's contraction principle and dynamic programming with stochastic discounting2
Strengthened clique-family inequalities for the stable set polytope2
Diffusion-level universality of many-server systems with concurrent service2
Online learning for route planning with on-time arrival reliability2
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem2
0.079909086227417