Operations Research Letters

Papers
(The median citation count of Operations Research Letters is 1. 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-04-01 to 2025-04-01.)
ArticleCitations
Age-based Markovian approximation of the G/M/1 queue59
Editorial Board25
An option pricing model with double-exponential jumps in returns and GARCH diffusion in volatilities25
Editorial Board20
Strategic inattention of multi-product firms with free entry18
Bounds on revenue for the random consideration set choice model16
Editorial Board15
Editorial Board14
Editorial Board11
On upper bounds for the multiple knapsack assignment problem11
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations10
On the complexity of scheduling unrelated parallel machines with limited preemptions10
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate10
Computing the worst-case due dates violations with budget uncertainty9
Differential game approach to pricing and advertising decisions9
Freight consolidation through carrier collaboration - A cooperative game9
Combined pricing and inventory control with multiple unreliable suppliers9
Business models for public emission reduction projects8
A randomized algorithm for online metric b-matching8
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case8
A simplified completely positive reformulation for binary quadratic programs7
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing7
Approximating Nash equilibrium for production control with sticky price7
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem7
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations7
Detecting stock market regimes from option prices7
Efficient sampling from phase-type distributions6
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments6
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization6
The principle of optimality in dynamic programming: A pedagogical note6
On BASTA for discrete-time queues6
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion6
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope6
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis6
Assortment optimization with repeated exposures and product-dependent patience cost5
Non-nested estimators for the central moments of a conditional expectation and their convergence properties5
Envy-free matchings with one-sided preferences and matroid constraints5
Communication-aware scheduling of precedence-constrained tasks on related machines5
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier5
Single machine robust scheduling with budgeted uncertainty5
Nonparametric identification and estimation of score auctions in multi-attribute procurement5
Performance bound for myopic order-up-to inventory policies under stationary demand processes5
A robust approach for modeling limited observability in bilevel optimization5
A decomposition method for solving multicommodity network equilibria5
New results on multi-dimensional linear discriminant analysis5
Generalised 2-circulant inequalities for the max-cut problem5
A queueing model for customer rescheduling and no-shows in service systems5
Comparing the costs of Any Fit algorithms for bin packing5
Direct solution of the normal equations in interior point methods for convex transportation problems5
Computing a common prior4
Lower bound on size of branch-and-bound trees for solving lot-sizing problem4
Optimal transport divergences induced by scoring functions4
A comparison study on responsiveness of three mechanisms to affirmative action in school choice4
Approximation algorithm for the stochastic prize-collecting set multicover problem4
Gradients and subgradients of buffered failure probability4
Some more subclasses of Q-matrix4
Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects4
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation4
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]4
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands4
Asymptotics for the survival probability of time-inhomogeneous diffusion processes4
Faster algorithm and sharper analysis for constrained Markov decision process3
Assortment optimization under the multinomial logit choice model with product-specific capacities3
On the many-server fluid limit for a service system with routing based on delayed information3
The secretary problem with multiple job vacancies and batch candidate arrivals3
Bidding to procure supply in newsvendor networks3
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system3
Point and interval estimation of decomposition error in discrete-time open tandem queues3
A refined analysis of submodular Greedy3
Asymptotic probability of majority inversion under a general binomial voting model3
Fairness in accessibility of public service facilities3
The bipartite travelling salesman problem: A pyramidally solvable case3
Discrete multi-module capacitated lot-sizing problems with multiple items3
Convergence analysis of a subsampled Levenberg-Marquardt algorithm3
Optimal switching policy for batch servers3
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number3
Data-driven preventive maintenance for a heterogeneous machine portfolio3
Nash equilibria of quasisupermodular games3
Diffusion-level universality of many-server systems with concurrent service3
On the optimal design of the randomized unbiased Monte Carlo estimators3
Continuous cutting plane algorithms in integer programming3
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs3
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming3
Incentive-compatible cost allocations for inventory games with private information3
Break maximization for round-robin tournaments without consecutive breaks3
On the complexity of surrogate and group relaxation for integer linear programs3
On the capacity inequalities for the heterogeneous vehicle routing problem3
Editorial Board3
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates3
Editorial Board3
Best arm identification in generalized linear bandits3
Computable error bounds of multidimensional Euler inversion and their financial applications3
A many-server functional strong law for a non-stationary loss model3
Hedging-based utility risk measure customized for individual investors3
Evaluating mixed-integer programming models over multiple right-hand sides3
Data-driven hedging of stock index options via deep learning3
Recursive calculation of moments in priority queues3
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem2
Online minimum matching with uniform metric and random arrivals2
Negative prices in network pricing games2
Envy-free house allocation with minimum subsidy2
Erratum to “Two dimensional maximum weight matching using Manhattan topology” [Oper. Res. Lett. 50 (3) (2022) 281–286]2
A novel stepsize for gradient descent method2
Reducibility bounds of objective functions over the integers2
Saturating stable matchings2
A market-based approach for enabling inter-area reserve exchange2
Structured pruning of neural networks for constraints learning2
Strengthened clique-family inequalities for the stable set polytope2
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2
Towards optimal running times for optimal transport2
Complexity of Source-Sink Monotone 2-parameter min cut2
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure2
Convex optimization under combinatorial sparsity constraints2
Ellipsoidal classification via semidefinite programming2
Perov's contraction principle and dynamic programming with stochastic discounting2
SPT optimality (mostly) via linear programming2
CABRA: Clustering algorithm based on regular arrangement2
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains2
WaveCorr: Deep reinforcement learning with permutation invariant convolutional policy networks for portfolio management2
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem2
Condition-based maintenance optimization based on matrix algebra2
Online learning for route planning with on-time arrival reliability2
Lose oneself in comparison: An investment and consumption game between two agents2
On robustness in nonconvex optimization with application to defense planning2
Population monotonic allocation schemes for the two-period economic lot-sizing games2
Future memories are not needed for large classes of POMDPs2
Sequential convergence of AdaGrad algorithm for smooth convex optimization2
Nonparametric data-driven learning algorithms for multilocation inventory systems2
Can partial cooperation between developed and developing countries be stable?2
A random arrival rule for airport problems with fuzzy costs2
Complete rent dissipation in contest with power technologies2
A greedy algorithm for finding maximum spanning trees in infinite graphs2
Ergodic inventory control with diffusion demand and general ordering costs2
Primal separation and approximation for the {0,1/2}-closure2
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes2
Orthogonal schedules in single round robin tournaments2
On the long-only minimum variance portfolio under single factor model2
On semidefinite descriptions for convex hulls of quadratic programs2
Editorial Board2
Cascading failures in the global financial system: A dynamical model2
The non-Markovian nature of nested logit choice2
Uncertainty reduction in robust optimization2
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds2
Optimal performance of parallel-server systems with job size prediction errors2
Weighted scoring rules for selecting a compatible committee2
On the equivalence of the Boston and top trading cycles school choice mechanisms2
Implied volatility slopes and jumps in bitcoin options market2
On the optimality of a maintenance queueing system2
A bargaining game for implementing the equal gain splitting rule in sequencing situations2
Egalitarian allocation and players of certain type2
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization2
Editorial Board2
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables2
On equilibrium threshold strategies when choosing between observable and unobservable queues1
A two-population game in observable double-ended queuing systems1
Solutions for non-negatively weighted TU games derived from extension operators1
On truthful constrained heterogeneous facility location with max-variant cost1
Asymptotic stability in replicator dynamics derived from TU games1
Pitch, extension complexity, and covering problems1
Bounded mixed batch scheduling with job release dates and rejection1
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables1
The total matching polytope of complete bipartite graphs1
Can loss aversion explain sourcing diversification under supply risk?1
Optimality-based clustering: An inverse optimization approach1
Some asymptotic properties of the Erlang-C formula in many-server limiting regimes1
Revisiting surrogate relaxation for the multidimensional knapsack problem1
Improving constants of strong convexity in linear stochastic programming1
Preservation of transform orders under a semiparametric model and its mixture1
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem1
On the complexity of robust bilevel optimization with uncertain follower's objective1
MDPs with setwise continuous transition probabilities1
Online load balancing with general reassignment cost1
Column generation extensions of set covering greedy heuristics1
Cyclic coordinate descent in the Hölder smooth setting1
On the structure of optimal solutions in a mathematical programming problem in a convex space1
Editorial Board1
Transient analysis of an affine Queue-Hawkes process1
A note on the stability of monotone Markov chains1
The inverse optimal value problem for linear fractional programming1
Playing against no-regret players1
Optimality of DSatur algorithm on chordal graphs1
The number of overlapping customers1
Decomposition methods for Wasserstein-based data-driven distributionally robust problems1
Parameterized complexity of configuration integer programs1
Oligopolistic markets with leadership, cooperative followers and a multivalued inverse demand function1
The circle packing problem: A theoretical comparison of various convexification techniques1
The complexity of geometric scaling1
Editorial Board1
An FPTAS for scheduling with resource constraints1
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function1
On the population monotonicity of independent set games1
Optimal payoff under the generalized dual theory of choice1
Further remarks on absorbing Markov decision processes1
On the exactness of the ε-constraint method for biobjective nonlinear integer programming1
Risk aversion in first-price security-bid auctions1
The effect of information on queue-scalping service systems1
Single-item lot-sizing with quantity discount and bounded inventory1
Erratum to “Cooperative equilibria of strategy-form games with both nontransferable and transferable utilities” [Oper. Res. Lett. 54 (2024) 107109]1
Editorial Board1
Absorbing games with irrational values1
Distributionally robust chance constraint with unimodality-skewness information and conic reformulation1
Publisher's note1
Two dimensional maximum weight matching using Manhattan topology1
A historical note on the complexity of scheduling problems1
Busy periods of discrete-time queues using the Lagrange implicit function theorem1
A shortage probability metric for battery depletion risk1
On the dimension of the set of yolk centers1
Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach1
Existence results for quasi-equilibrium problems under a weaker equilibrium condition1
Online load balancing on uniform machines with limited migration1
A note on social learning in non-atomic routing games1
Algorithms for fair k-clustering with multiple protected attributes1
Distributed stochastic nonsmooth nonconvex optimization1
Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps1
An inexact column-and-constraint generation method to solve two-stage robust optimization problems1
Editorial Board1
On the effective dimension and multilevel Monte Carlo1
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space1
Max cut and semidefinite rank1
Complexity of linear minimization and projection on some sets1
Solving nonlinear equations with the convex combination of two positive spectral coefficients1
Tighter ‘uniform bounds for Black–Scholes implied volatility’ and the applications to root-finding1
Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous1
A note on the online interval scheduling secretary problem1
Editorial Board1
Traveling salesman problem with backend information processing1
On the equivalence of two competing affirmative actions in school choice1
Editorial Board1
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP1
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis1
On approximations of data-driven chance constrained programs over Wasserstein balls1
Platform exploitation in the sharing economy1
Distributionally robust chance constrained games under Wasserstein ball1
Circulant TSP special cases: Easily-solvable cases and improved approximations1
Instability of LRTF multiclass queueing networks1
Constant approximation for fault-tolerant median problems via iterative rounding1
The optimal solution of ESG portfolio selection models that are based on the average ESG score1
Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy1
Monotonicity of extremal Walrasian prices in gross substitutes markets1
On the core of information sharing games1
An explicit three-term Polak–Ribière–Polyak conjugate gradient method for bicriteria optimization1
Hierarchically constrained blackbox optimization1
Throughput scheduling with equal additive laxity1
Relaxations of sign symmetry and the weighted solidarity values1
Editorial Board1
A combined variable aggregation presolving technique for mixed integer programming1
Multi-product pricing: A discrete choice model based on Markov Chain Choice Model combined with reservation prices1
A study of lattice reformulations for integer programming1
A fast exact pricing algorithm for the railway crew scheduling problem1
On the nature of Bregman functions1
0.11500406265259