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