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 2020-03-01 to 2024-03-01.)
ArticleCitations
Energy and reserve dispatch with distributionally robust joint chance constraints33
Tractable reformulations of two-stage distributionally robust linear programs over the type-30
Risk quantification and validation for Bitcoin27
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation20
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem20
Omnichannel operations with ship-from-store20
On maximizing a monotone k-submodular function under a knapsack constraint19
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem19
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for routing problems with time windows17
Sequential convergence of AdaGrad algorithm for smooth convex optimization16
A dynamic analysis of corporate investments and emission tax policy in an oligopoly market with network externality14
A change point estimation problem related to age replacement policies14
Connectedness of weak minimal solution set for set optimization problems13
Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system11
A novel approach to Hölder continuity of a class of parametric variational–hemivariational inequalities11
Complexity of linear minimization and projection on some sets11
Inverse optimization in semi-infinite linear programs10
Guidelines for the computational testing of machine learning approaches to vehicle routing problems10
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis10
Scalable holistic linear regression10
Generic stability of Nash equilibria for noncooperative differential games9
A note on monotone mean–variance preferences for continuous processes9
Strategic delegation in a differentiated duopoly with asymmetric costs9
Censored lifetime learning: Optimal Bayesian age-replacement policies9
Stochastic comparisons of lifetimes of series and parallel systems with dependent and heterogeneous components8
A subgradient method for equilibrium problems involving quasiconvex bifunctions8
A decomposition heuristic for mixed-integer supply chain problems8
Solving nested-constraint resource allocation problems with an interior point method8
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations8
Robust single machine makespan scheduling with release date uncertainty8
Near-optimal Nonlinear Regression Trees8
A distributionally robust area under curve maximization model8
Analysis of the symmetric join the shortest orbit queue7
Existence results for quasi-equilibrium problems under a weaker equilibrium condition7
The Myerson value for directed graph games7
A revised approach for risk-averse multi-armed bandits under CVaR criterion7
Scheduling with partial rejection7
Decomposition methods for Wasserstein-based data-driven distributionally robust problems7
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function7
Piecewise polyhedral formulations for a multilinear term7
Determining matchdays in sports league schedules to minimize rest differences7
Does Bitcoin dominate the price discovery of the Cryptocurrencies market? A time-varying information share analysis7
On the complexity of pattern feasibility problems in time-relaxed sports timetabling7
A note on a variant of the online open end bin packing problem6
Zero-wait load balancing with sparse messaging6
Dynamic repositioning for vehicle sharing with setup costs6
A refined analysis of submodular Greedy6
The multi-league sports scheduling problem, or how to schedule thousands of matches6
Optimal payoff under the generalized dual theory of choice6
Equilibrium analysis of unobservable MM6
Discrete time Markov chain model for age of information6
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials6
On greedy heuristics for computing D-efficient saturated subsets6
Portfolio selection with parameter uncertainty under α maxmin mean–var6
On stochastic auctions in risk-averse electricity markets with uncertain supply5
A robust approach for modeling limited observability in bilevel optimization5
A polyhedral approach to bisubmodular function minimization5
An implementation of steepest-descent augmentation for linear programs5
MDPs with setwise continuous transition probabilities5
On the exactness of the ε-constraint method for biobjective nonlinear integer programming5
Differential game approach to pricing and advertising decisions5
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable5
A faster algorithm for the continuous bilevel knapsack problem5
Improving the min–max method for multiobjective programming5
Social welfare and price of anarchy in preemptive priority queues5
Ants can orienteer a thief in their robbery5
On the many-server fluid limit for a service system with routing based on delayed information5
Inverse integer optimization with an imperfect observation5
An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions5
Adaptive allocation rules for hypergraph games5
Throughput and delay optimality of power-of-d choices in inhomogeneous load balancing systems5
Polynomial size IP formulations of knapsack may require exponentially large coefficients5
On Minty-variational inequalities and evolutionary stable states of generalized monotone games5
Customer equilibrium and optimal pricing in an M/G/1 queue with heterogeneous rewards and waiting cost rates5
Cost analysis in global supply chains4
Constrained Markov decision processes with uncertain costs4
Strong relaxations for continuous nonlinear programs based on decision diagrams4
Extremal models for the GIG4
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem4
An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach4
On the minimal displacement vector of the Douglas–Rachford operator4
A class ofN-player Colonel Blotto games with multidimensional private 4
Asymptotically optimal idling in the GI/GI/N+GI queue4
Binary, unrelaxable and hidden constraints in blackbox optimization4
Efficiency fairness tradeoff in battery sharing4
Optimal dividend-distribution strategy under ambiguity aversion4
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP4
Necessary versus equal players in axiomatic studies4
An optimal mechanism charging for priority in a queue4
Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems4
Note on pairwise negative dependence of randomly shifted and jittered rank-1 lattices4
The Matroid Cup Game4
The optimal solution of ESG portfolio selection models that are based on the average ESG score4
On the complexity of robust bilevel optimization with uncertain follower's objective4
A comparison of inventory policies for perishable goods4
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing4
Improved front steepest descent for multi-objective optimization4
A lower bound on the stability region of redundancy-d with FIFO ser3
Distributionally robust chance constraint with unimodality-skewness information and conic reformulation3
How to bid in unified second-price auctions when requests are duplicated3
Logarithmic sample bounds for Sample Average Approximation with capacity- or budget-constraints3
On the complexity of surrogate and group relaxation for integer linear programs3
Strategic revenue management of preemptive versus non-preemptive queues3
Privacy impact on generalized Nash equilibrium in peer-to-peer electricity market3
Approximation algorithms for the a priori traveling repairman3
Three-player sequential contests with asymmetric valuations3
Separation between second price auctions with personalized reserves and the revenue optimal auction3
Nonparametric identification and estimation of score auctions in multi-attribute procurement3
Transaction activity and bitcoin realized volatility3
Designing a referral reward program in freemium: The role of network externalities3
Distributionally robust Optimal Control and MDP modeling3
Best arm identification in generalized linear bandits3
Extended formulations for matroid polytopes through randomized protocols3
A note on yardstick regulation of fishery monopolies3
On approximations of data-driven chance constrained programs over Wasserstein balls3
k-additive upper approximation of TU-games3
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem3
Dividend optimization for jump–diffusion model with solvency constraints3
Negative prices in network pricing games3
Fitting discrete phase-type distribution from censored and truncated observations with pre-specified hazard sequence3
The effect of information on queue-scalping service systems3
Product sequencing and pricing under cascade browse model3
The matroid intersection cover problem3
Incomplete markets, Knightian uncertainty and high-water marks3
Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid3
A machine learning efficient frontier3
Maximizing revenue for publishers using header bidding and ad exchange auctions3
Support vector machines as Bayes' classifiers3
Bias optimality of admission control in a non-stationary repairable queue3
Annuitization and asset allocation with borrowing constraint3
τ-value for risk capital allocation problems3
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes3
An information theory perspective on the balanced minimum evolution problem3
On construction of new NCP functions3
Cover by disjoint cliques cuts for the knapsack problem with conflicting items3
Detecting stock market regimes from option prices3
Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation3
A hybrid algorithm for the minimum bounding sphere problem3
Lower bound on size of branch-and-bound trees for solving lot-sizing problem3
Partially observable multistage stochastic programming3
Partial stochastic dominance via optimal transport3
On the strength of recursive McCormick relaxations for binary polynomial optimization3
Single machine robust scheduling with budgeted uncertainty2
Quadratic double-ratio minimax optimization2
A note on Σ22
Multi-armed bandit with sub-exponential rewards2
A hybrid model for airline seat inventory control of the multi-leg problems2
Inequality in population weights, majority threshold and the inversion probability in the case of three states2
Minimum-error classes for matching parts2
Gearhart–Koshy acceleration for affine subspaces2
Coping with the Renewable Portfolio Standards: A utility’s perspective2
Gradients and subgradients of buffered failure probability2
Parameterized approximations for the two-sided assortment optimization2
A reformulated Shapley-like value for cooperative games with interval payoffs2
Half-cycle: A new formulation for modelling kidney exchange problems2
Complexity bounds for approximately solving discounted MDPs by value iterations2
Revisiting surrogate relaxation for the multidimensional knapsack problem2
A strengthened Barvinok-Pataki bound on SDP rank2
Lifting the knapsack cover inequalities for the knapsack polytope2
Preservation of transform orders under a semiparametric model and its mixture2
Oligopoly newsvendor competition with reference effects2
Comparison of socially optimal and profit maximizing prices in an unobservable queue with heterogeneous waiting costs2
Reaching Paris Agreement goal through carbon dioxide removal development: A compact OR model2
Improving on Best-of-Many-Christofides for T-tours2
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds2
Strategic behavior in queues with the effect of the number of customers behind2
Data-driven preventive maintenance for a heterogeneous machine portfolio2
A note on the finite convergence of alternating projections2
Convergence analysis of a subsampled Levenberg-Marquardt algorithm2
A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains2
Investment timing, agency and overconfidence2
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on 2
Approximating Nash equilibrium for production control with sticky price2
Static replication of impermanent loss for concentrated liquidity provision in decentralised markets2
A note on the approximability of deepest-descent circuit steps2
When “Better” is better than “Best”2
BSDE approach to utility maximization with square-root factor processes2
On the population monotonicity of independent set games2
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming2
Star-Shaped deviations2
Optimality-based clustering: An inverse optimization approach2
Managing inventory in a network: Performance bounds for simple policies2
On complexity of multistage stochastic programs under heavy tailed distributions2
Continuous-time zero-sum stochastic game with stopping and control2
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables2
Instability of LAS multiclass queueing networks2
Online load balancing with general reassignment cost2
An approximation of general multi-server queues with bulk arrivals and batch service2
On globally solving the extended trust-region subproblems2
A modified Barzilai-Borwein algorithm for the generalized absolute value equation2
An inexact column-and-constraint generation method to solve two-stage robust optimization problems2
A greedy algorithm for finding maximum spanning trees in infinite graphs2
Make waiting not to seem like waiting: Capacity management of waiting-area entertainment2
A decomposition method for solving multicommodity network equilibria2
A note on oligopoly exploitation of common-pool renewable resources2
Performance bound for myopic order-up-to inventory policies under stationary demand processes2
Rational joining behavior in a queueing system with abandonments2
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system2
To incentivize the fast server or not? Firm's dilemma when queue signals service rate in high-contact services2
Integer packing sets form a well-quasi-ordering2
Non-nested estimators for the central moments of a conditional expectation and their convergence properties2
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem2
Approximate performance measures for a single station two-stage reneging queue2
Information sharing and information errors with noninferable demand2
A two-population game in observable double-ended queuing systems2
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem2
Online cardinality constrained scheduling2
A sufficient condition for asymptotically well behaved property of convex polynomials2
Transient analysis of an affine Queue-Hawkes process2
When can we improve on sample average approximation for stochastic optimization?2
The efficiency-fairness balance of Round Robin scheduling2
A fast exact pricing algorithm for the railway crew scheduling problem2
A useful technique for piecewise deterministic Markov decision processes2
Fast proximal algorithms for nonsmooth convex optimization2
Robust risk-taking under a sustainable constraint2
Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems2
Condition-based maintenance optimization based on matrix algebra2
Debt recapitalization and value in waiting to finance a project2
Algorithms for fair k-clustering with multiple protected attributes2
Lose oneself in comparison: An investment and consumption game between two agents2
Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations2
0.035156011581421