Operations Research Letters

Article	Citations
Age-based Markovian approximation of the G/M/1 queue	53
A queueing model for customer rescheduling and no-shows in service systems	21
The bipartite travelling salesman problem: A pyramidally solvable case	20
Fairness in accessibility of public service facilities	19
Computing a common prior	16
Editorial Board	15
A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation	13
Strategic inattention of multi-product firms with free entry	11
Editorial Board	10
Bounds on revenue for the random consideration set choice model	10
Editorial Board	9
Editorial Board	9
On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs	9
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations	9
On upper bounds for the multiple knapsack assignment problem	9
On the number of tests needed for the pooled testing halving scheme	8
Gearhart–Koshy acceleration for affine subspaces	8
Evaluating mixed-integer programming models over multiple right-hand sides	8
A short proof of convexity of step-out–step-in sequencing games	8
On the complexity of scheduling unrelated parallel machines with limited preemptions	8
On the minimal displacement vector of the Douglas–Rachford operator	7
Combined pricing and inventory control with multiple unreliable suppliers	7
Computing the worst-case due dates violations with budget uncertainty	7
A many-server functional strong law for a non-stationary loss model	7
Freight consolidation through carrier collaboration - A cooperative game	7

Spanning tree constrained determinantal point processes are hard to (approximately) evaluate	7
A decomposition method for solving multicommodity network equilibria	6
Communication-aware scheduling of precedence-constrained tasks on related machines	6
Envy-free matchings with one-sided preferences and matroid constraints	6
Non-nested estimators for the central moments of a conditional expectation and their convergence properties	6
A refined analysis of submodular Greedy	6
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case	6
Differential game approach to pricing and advertising decisions	6
Universally optimal staffing of Erlang-A queues facing uncertain arrival rates	6
A randomized algorithm for online metric b-matching	6
Nonparametric identification and estimation of score auctions in multi-attribute procurement	5
Approximating Nash equilibrium for production control with sticky price	5
Lower bound on size of branch-and-bound trees for solving lot-sizing problem	5
When “Better” is better than “Best”	5
On the optimal design of the randomized unbiased Monte Carlo estimators	5
New results on multi-dimensional linear discriminant analysis	5
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming	5
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem	5
Assortment optimization with repeated exposures and product-dependent patience cost	5
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier	5
Business models for public emission reduction projects	5
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system	5
Generalised 2-circulant inequalities for the max-cut problem	5
Comparing the costs of Any Fit algorithms for bin packing	4
Asymptotics for the survival probability of time-inhomogeneous diffusion processes	4
Performance bound for myopic order-up-to inventory policies under stationary demand processes	4
Discrete multi-module capacitated lot-sizing problems with multiple items	4
The secretary problem with multiple job vacancies and batch candidate arrivals	4
A simplified completely positive reformulation for binary quadratic programs	4
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands	4
Gradients and subgradients of buffered failure probability	4
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion	4
Some more subclasses of Q-matrix	4
A comparison study on responsiveness of three mechanisms to affirmative action in school choice	4
Detecting stock market regimes from option prices	4
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable	4
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing	4
Computable error bounds of multidimensional Euler inversion and their financial applications	3
Hedging-based utility risk measure customized for individual investors	3
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains	3
Direct solution of the normal equations in interior point methods for convex transportation problems	3
A novel stepsize for gradient descent method	3
Approximate performance measures for a single station two-stage reneging queue	3
Break maximization for round-robin tournaments without consecutive breaks	3
Complete rent dissipation in contest with power technologies	3
On BASTA for discrete-time queues	3
The principle of optimality in dynamic programming: A pedagogical note	3
Incentive-compatible cost allocations for inventory games with private information	3
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis	3
Convex optimization under combinatorial sparsity constraints	3

On the complexity of surrogate and group relaxation for integer linear programs	3
Population monotonic allocation schemes for the two-period economic lot-sizing games	3
Approximation algorithm for the stochastic prize-collecting set multicover problem	3
Nash equilibria of quasisupermodular games	3
Convergence analysis of a subsampled Levenberg-Marquardt algorithm	3
Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope	3
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization	3
A robust approach for modeling limited observability in bilevel optimization	3
Efficient sampling from phase-type distributions	3
Orthogonal schedules in single round robin tournaments	3
Continuous cutting plane algorithms in integer programming	3
Point and interval estimation of decomposition error in discrete-time open tandem queues	3
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations	3
Recursive calculation of moments in priority queues	3
Single machine robust scheduling with budgeted uncertainty	3
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]	3
Data-driven hedging of stock index options via deep learning	3
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments	3
Optimal transport divergences induced by scoring functions	3
Leveraging platform intermediaries for licensing in technology-intensive supply chains with network effects	3
Best arm identification in generalized linear bandits	3
On the equivalence of the Boston and top trading cycles school choice mechanisms	2
Perov's contraction principle and dynamic programming with stochastic discounting	2
Diffusion-level universality of many-server systems with concurrent service	2
Strengthened clique-family inequalities for the stable set polytope	2
Online learning for route planning with on-time arrival reliability	2
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem	2
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP	2
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables	2
Ergodic inventory control with diffusion demand and general ordering costs	2
On truthful constrained heterogeneous facility location with max-variant cost	2
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 uncertainty	2
Complexity of Source-Sink Monotone 2-parameter min cut	2
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem	2
Editorial Board	2
Weighted scoring rules for selecting a compatible committee	2
Optimal switching policy for batch servers	2
Strategic revenue management of preemptive versus non-preemptive queues	2
Editorial Board	2
A market-based approach for enabling inter-area reserve exchange	2
A random arrival rule for airport problems with fuzzy costs	2
Near-optimal Nonlinear Regression Trees	2
On robustness in nonconvex optimization with application to defense planning	2
Ellipsoidal classification via semidefinite programming	2
WaveCorr: Deep reinforcement learning with permutation invariant convolutional policy networks for portfolio management	2
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function	2
Editorial Board	2
Data-driven preventive maintenance for a heterogeneous machine portfolio	2
Editorial Board	2
A novel approach to Hölder continuity of a class of parametric variational–hemivariational inequalities	2
On the optimality of a maintenance queueing system	2
Envy-free house allocation with minimum subsidy	2
SPT optimality (mostly) via linear programming	2
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number	2
Bidding to procure supply in newsvendor networks	2
Towards optimal running times for optimal transport	2
On the many-server fluid limit for a service system with routing based on delayed information	2
On semidefinite descriptions for convex hulls of quadratic programs	2
Asymptotic probability of majority inversion under a general binomial voting model	2
Reducibility bounds of objective functions over the integers	2
Egalitarian allocation and players of certain type	2
On the long-only minimum variance portfolio under single factor model	2
Negative prices in network pricing games	2
Online minimum matching with uniform metric and random arrivals	2
The non-Markovian nature of nested logit choice	2
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization	2
Saturating stable matchings	2
A greedy algorithm for finding maximum spanning trees in infinite graphs	2
Optimal performance of parallel-server systems with job size prediction errors	2
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes	2
Can partial cooperation between developed and developing countries be stable?	2
Faster algorithm and sharper analysis for constrained Markov decision process	2
Editorial Board	2
Stochastic comparisons of lifetimes of series and parallel systems with dependent and heterogeneous components	2
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure	2
Lose oneself in comparison: An investment and consumption game between two agents	2
The effect of information on queue-scalping service systems	2
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds	2
Constant approximation for fault-tolerant median problems via iterative rounding	1

Online load balancing on uniform machines with limited migration	1
Absorbing games with irrational values	1
Algorithms for fair k-clustering with multiple protected attributes	1
Playing against no-regret players	1
On Gaussian Markov processes and Polya processes	1
Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach	1
Existence results for quasi-equilibrium problems under a weaker equilibrium condition	1
Primal separation and approximation for the {0,1/2}-closure	1
MDPs with setwise continuous transition probabilities	1
On the structure of optimal solutions in a mathematical programming problem in a convex space	1
Nonparametric data-driven learning algorithms for multilocation inventory systems	1
Condition-based maintenance optimization based on matrix algebra	1
On equilibrium threshold strategies when choosing between observable and unobservable queues	1
Can loss aversion explain sourcing diversification under supply risk?	1
On the exactness of the ε-constraint method for biobjective nonlinear integer programming	1
Implied volatility slopes and jumps in bitcoin options market	1
Preservation of transform orders under a semiparametric model and its mixture	1
Editorial Board	1
Comparison of socially optimal and profit maximizing prices in an unobservable queue with heterogeneous waiting costs	1
Editorial Board	1
Editorial Board	1
Tight distortion bounds for distributed metric voting on a line	1
Editorial Board	1
Improving constants of strong convexity in linear stochastic programming	1
Solutions for non-negatively weighted TU games derived from extension operators	1
Oligopolistic markets with leadership, cooperative followers and a multivalued inverse demand function	1
A branch-and-bound method for the minimum k−enclosing ball problem	1
Future memories are not needed for large classes of POMDPs	1
The complexity of geometric scaling	1
A combined variable aggregation presolving technique for mixed integer programming	1
Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy	1
Diffusion approximation of a special bandwidth sharing model via infinitesimal generators with a lifting-projection method	1
Decomposition methods for Wasserstein-based data-driven distributionally robust problems	1
Distributionally robust chance constrained games under Wasserstein ball	1
Uncertainty reduction in robust optimization	1
Parameterized complexity of configuration integer programs	1
On the equivalence of two competing affirmative actions in school choice	1
Further remarks on absorbing Markov decision processes	1
Solving nonlinear equations with the convex combination of two positive spectral coefficients	1
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis	1
Bounded mixed batch scheduling with job release dates and rejection	1
A study of lattice reformulations for integer programming	1
Structured pruning of neural networks for constraints learning	1
On the population monotonicity of independent set games	1
Sequential convergence of AdaGrad algorithm for smooth convex optimization	1
On approximations of data-driven chance constrained programs over Wasserstein balls	1
CABRA: Clustering algorithm based on regular arrangement	1
Instability of LRTF multiclass queueing networks	1
A note on social learning in non-atomic routing games	1
Revisiting surrogate relaxation for the multidimensional knapsack problem	1
Complexity of linear minimization and projection on some sets	1
Logarithmic sample bounds for Sample Average Approximation with capacity- or budget-constraints	1
Editorial Board	1
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem	1
Scalar representations and Hausdorff continuity of solution mappings to parametric set optimization problems via set less order relations	1
Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization	1
On the softplus penalty for large-scale convex optimization	1
A note on the online interval scheduling secretary problem	1
Optimality-based clustering: An inverse optimization approach	1
Optimal payoff under the generalized dual theory of choice	1
Max cut and semidefinite rank	1
Distributed stochastic nonsmooth nonconvex optimization	1
Distributionally robust chance constraint with unimodality-skewness information and conic reformulation	1
Multi-product pricing: A discrete choice model based on Markov Chain Choice Model combined with reservation prices	1
Some asymptotic properties of the Erlang-C formula in many-server limiting regimes	1
The circle packing problem: A theoretical comparison of various convexification techniques	1
A fast exact pricing algorithm for the railway crew scheduling problem	1
Asymptotic stability in replicator dynamics derived from TU games	1
Single-item lot-sizing with quantity discount and bounded inventory	1
Column generation extensions of set covering greedy heuristics	1
Throughput scheduling with equal additive laxity	1
Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous	1
An inexact column-and-constraint generation method to solve two-stage robust optimization problems	1
Online load balancing with general reassignment cost	1
A bargaining game for implementing the equal gain splitting rule in sequencing situations	1
Traveling salesman problem with backend information processing	1
Transient analysis of an affine Queue-Hawkes process	1
Pitch, extension complexity, and covering problems	1
The total matching polytope of complete bipartite graphs	1
Cascading failures in the global financial system: A dynamical model	1
On the effective dimension and multilevel Monte Carlo	1
Editorial Board	1
Platform exploitation in the sharing economy	1
Risk aversion in first-price security-bid auctions	1
Answer to an open problem about stochastic comparison of parallel systems with geometric components	1
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space	1
Publisher's note	1
On the complexity of robust bilevel optimization with uncertain follower's objective	1
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once	1
Computing k-centers of uncertain points on a real line	1
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables	1
Hierarchically constrained blackbox optimization	1
Editorial Board	1
A historical note on the complexity of scheduling problems	1
Busy periods of discrete-time queues using the Lagrange implicit function theorem	1