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-06-01 to 2025-06-01.)
ArticleCitations
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem29
Editorial Board25
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments23
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization18
Editorial Board18
Bounds on revenue for the random consideration set choice model18
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations15
Single machine robust scheduling with budgeted uncertainty13
Erratum to “Two dimensional maximum weight matching using Manhattan topology” [Oper. Res. Lett. 50 (3) (2022) 281–286]13
The secretary problem with multiple job vacancies and batch candidate arrivals13
Nonparametric data-driven learning algorithms for multilocation inventory systems11
Orthogonal schedules in single round robin tournaments11
A greedy algorithm for finding maximum spanning trees in infinite graphs11
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty11
Can partial cooperation between developed and developing countries be stable?11
Condition-based maintenance optimization based on matrix algebra9
Implied volatility slopes and jumps in bitcoin options market9
The effect of information on queue-scalping service systems9
Saturating stable matchings9
On semidefinite descriptions for convex hulls of quadratic programs9
Answer to an open problem about stochastic comparison of parallel systems with geometric components8
Faster algorithm and sharper analysis for constrained Markov decision process8
Distributionally robust chance constraint with unimodality-skewness information and conic reformulation8
On the complexity of surrogate and group relaxation for integer linear programs8
Solving nonlinear equations with the convex combination of two positive spectral coefficients8
A novel stepsize for gradient descent method8
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once7
A study of lattice reformulations for integer programming7
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables7
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis7
Scalar representations and Hausdorff continuity of solution mappings to parametric set optimization problems via set less order relations7
On the exactness of the ε-constraint method for biobjective nonlinear integer programming7
Almost tight bounds for online hypergraph matching6
Robust knapsack ordering for a partially-informed newsvendor with budget constraint6
Irreversible investment with random delay and partial prepayment6
A gradient-based method to calculate (s,S) policies6
Scoring indices, top-truncated preferences, and splitting invariance6
Approximation algorithm for the 2-stage stochastic matroid base problem6
Distributionally robust modeling of optimal control6
Optimal admission control in queues with abandonments6
A note on clustering aggregation for binary clusterings6
A new sampling approach for Bayesian sample size analysis in applications of queueing models5
Reduced game and constrained egalitarianism5
Variance comparison between infinitesimal perturbation analysis and likelihood ratio estimators to stochastic gradient5
On the asymptotic optimality of the cμ-rule in queueing networks5
Transaction activity and bitcoin realized volatility5
On the impossibility of decomposing binary matroids5
Asymptotic optimality of base-stock policies for lost-sales inventory systems with stochastic lead times5
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces5
A hybrid algorithm for the minimum bounding sphere problem5
Static replication of impermanent loss for concentrated liquidity provision in decentralised markets5
Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid5
Coalition structure value considering the outside alignment option of priori coalition5
On data reduction for dynamic vector bin packing5
Publisher's note4
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms4
Partitional clustering via successive transportation problems4
The bipartite travelling salesman problem: A pyramidally solvable case4
Socially fair network design via iterative rounding4
A knapsack intersection hierarchy4
Convergence rate analysis of the multiplicative gradient method for PET-type problems4
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]4
Efficient sampling from phase-type distributions4
A note on sign symmetry for a subclass of efficient, symmetric, and linear values4
Optimal operational service levels in vendor managed inventory contracts - an exact approach4
Evaluating mixed-integer programming models over multiple right-hand sides4
Performance bound for myopic order-up-to inventory policies under stationary demand processes4
Privacy impact on generalized Nash equilibrium in peer-to-peer electricity market4
On the complexity of robust bilevel optimization with uncertain follower's objective3
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing3
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space3
A note on the stability of monotone Markov chains3
Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous3
Editorial Board3
Perov's contraction principle and dynamic programming with stochastic discounting3
A sufficient condition for asymptotically well behaved property of convex polynomials3
Population monotonic allocation schemes for the two-period economic lot-sizing games3
On the effective dimension and multilevel Monte Carlo3
Ergodic inventory control with diffusion demand and general ordering costs3
A blessing in disguise: Collusion equivalent phenomenon under environmental regulation3
A refined analysis of submodular Greedy3
Parameterized complexity of configuration integer programs3
Optimality-based clustering: An inverse optimization approach3
A two-population game in observable double-ended queuing systems3
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds3
An FPTAS for scheduling with resource constraints3
Future memories are not needed for large classes of POMDPs3
Extended formulations for matroid polytopes through randomized protocols3
Cascading failures in the global financial system: A dynamical model3
An optimal algorithm for the minimum-width cubic shell problem3
A random arrival rule for airport problems with fuzzy costs3
Finite customer-pool queues3
Envy-free house allocation with minimum subsidy3
An inexact column-and-constraint generation method to solve two-stage robust optimization problems3
Computing the worst-case due dates violations with budget uncertainty3
MDPs with setwise continuous transition probabilities3
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem3
Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach3
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem3
Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information3
Diffusion-level universality of many-server systems with concurrent service3
Ergodic theorems for queuing systems with dependent inter-arrival times3
Complexity of Source-Sink Monotone 2-parameter min cut3
A new approach to agglomeration problems3
Uncertainty reduction in robust optimization3
Correlated equilibrium of games with concave potential functions3
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains3
The finagle point is close to the yolk2
Combined pricing and inventory control with multiple unreliable suppliers2
Generalized ordinal Nash games: Variational approach2
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation2
Uncertain standard quadratic optimization under distributional assumptions: a chance-constrained epigraphic approach2
Optimal arrangement of servers for a tollbooth tandem queue with two heterogeneous servers2
Envy-free matchings with one-sided preferences and matroid constraints2
An inexact algorithm for stochastic variational inequalities2
Data-driven hedging of stock index options via deep learning2
Generalization of weighted-egalitarian Shapley values2
Nonparametric identification and estimation of score auctions in multi-attribute procurement2
Adaptive allocation rules for hypergraph games2
On the combined inverse-square effect of multiple points in multidimensional space2
The value function of a transportation problem2
Optimal control of queues with demand-driven discharge2
Online minimum matching with uniform metric and random arrivals2
Improved complexities for stochastic conditional gradient methods under interpolation-like conditions2
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes2
An approximation of general multi-server queues with bulk arrivals and batch service2
Asymptotic probability of majority inversion under a general binomial voting model2
A strengthened Barvinok-Pataki bound on SDP rank2
On the optimal design of the randomized unbiased Monte Carlo estimators2
Editorial Board2
On upper bounds for the multiple knapsack assignment problem2
Approximating Nash equilibrium for production control with sticky price2
On the complexity of a maintenance problem for hierarchical systems2
Business models for public emission reduction projects2
Optimal design of vaccination policies: A case study for Newfoundland and Labrador2
Computing a common prior2
In memoriam Gerhard Woeginger2
On the strength of recursive McCormick relaxations for binary polynomial optimization2
Central limit theorem and sample complexity of stationary stochastic programs2
Random assignments with uniform preferences: An impossibility result2
Hedging-based utility risk measure customized for individual investors2
On linear threshold policies for continuous-time dynamic yield management2
Assortment optimization under the multinomial logit choice model with product-specific capacities2
Editorial Board2
Traveling salesman problem with backend information processing2
Editorial Board2
Editorial Board2
Recognising permuted Demidenko matrices2
On the capacity inequalities for the heterogeneous vehicle routing problem2
Robust aircraft conflict resolution under trajectory prediction uncertainty2
Distributionally robust stochastic optimal control2
Editorial Board2
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound2
Fairness in accessibility of public service facilities2
Exact evaluation and optimization of integer-ratio policies for stochastic one-warehouse multiple-retailer inventory systems2
Communication-aware scheduling of precedence-constrained tasks on related machines2
Editorial Board2
Distributionally robust Optimal Control and MDP modeling2
Salesforce contracting under model uncertainty2
Multi-armed bandit with sub-exponential rewards2
Structured pruning of neural networks for constraints learning2
Editorial Board2
Primal separation and approximation for the {0,1/2}-closure2
Dynamic matching with teams2
Further remarks on absorbing Markov decision processes2
0.063807964324951