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