OOIR: Observatory of International Research

Papers

(The TQCC of Operations Research Letters is 3. 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 2022-08-01 to 2026-08-01.)

Article	Citations
Editorial Board	53
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem	23
Editorial Board	20
Endogenous reactive transshipment prices eliminate proactive transshipments and coordinate reactive transshipments	16
Single machine robust scheduling with budgeted uncertainty	15
Undertreatment in credence goods markets: when does a no-liability rule outperform?	14
On the convergence of conditional gradient method for unbounded multiobjective optimization problems	14
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations	14
Bounds on revenue for the random consideration set choice model	14
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization	14
Q tensor tuples to polynomial complementarity problems	14
Orthogonal schedules in single round robin tournaments	12
Individual versus social optimization in statistical estimation	11
Erratum to “Two dimensional maximum weight matching using Manhattan topology” [Oper. Res. Lett. 50 (3) (2022) 281–286]	11
On semidefinite descriptions for convex hulls of quadratic programs	9
Can partial cooperation between developed and developing countries be stable?	9
Nonparametric data-driven learning algorithms for multilocation inventory systems	9
Improved bounds on the probability of a union and on the number of events that occur	9
Faster algorithm and sharper analysis for constrained Markov decision process	8
A novel stepsize for gradient descent method	8
A Note on the Statistical Guarantee of the Probabilistic Branch-and-Bound Algorithms for Simulation Optimization: Counterexamples and Discussion	8
Implied volatility slopes and jumps in bitcoin options market	8
A greedy algorithm for finding maximum spanning trees in infinite graphs	8
Capacity variation in the many-to-one stable matching	8
Can a weaker player win? Adaptive play in repeated games	7

A new performance metric for the ski rental problem	7
A gradient-based method to calculate (s,S) policies	7
Geoffrion’s theorem beyond finiteness and rationality	7
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once	7
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis	7
Transshipments between (counter-) altruistic retailers	7
Almost tight bounds for online hypergraph matching	7
A stochastic model for optimizing crowdfunding campaign success	7
Scalar representations and Hausdorff continuity of solution mappings to parametric set optimization problems via set less order relations	7
Answer to an open problem about stochastic comparison of parallel systems with geometric components	7
Strong orientation of a connected graph for a crossing family	7
Solving nonlinear equations with the convex combination of two positive spectral coefficients	7
A study of lattice reformulations for integer programming	7
A unified framework for equilibrium existence in strategic-form games	6
Heavy traffic diffusion limit for a closed queueing network with single-server and infinite-server stations	6
A heuristic algorithm for aircraft conflict resolution based on closed-form analytical solutions of relaxed pairwise problems	6
Distributionally robust modeling of optimal control	6
A note on clustering aggregation for binary clusterings	6
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces	6
Optimal preemptive scheduling of two competing agents on uniform machines	6
Scoring indices, top-truncated preferences, and splitting invariance	6
On data reduction for dynamic vector bin packing	6
Reduced game and constrained egalitarianism	5
Irreversible investment with random delay and partial prepayment	5
On the impossibility of decomposing binary matroids	5
Editorial Board	5
Optimal admission control in queues with abandonments	5
Monotone convergence of spreading processes on networks	5
Coalition structure value considering the outside alignment option of priori coalition	5
Asymptotic optimality of base-stock policies for lost-sales inventory systems with stochastic lead times	5
Optimal operational service levels in vendor managed inventory contracts - an exact approach	5
Computational hardness of static distributionally robust Markov decision processes	5
A branch-&-price approach to the unrooted maximum agreement forest problem	5
Static replication of impermanent loss for concentrated liquidity provision in decentralised markets	5
Publisher's note	5
Robust knapsack ordering for a partially-informed newsvendor with budget constraint	5
Efficient sampling from phase-type distributions	4
Uncertainty reduction in robust optimization	4
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem	4
A knapsack intersection hierarchy	4
Socially fair network design via iterative rounding	4
Lifting cover inequalities for the robust knapsack problem	4
Future memories are not needed for large classes of POMDPs	4
Editorial Board	4
Approximate mixed type duality for semi-infinite programs having equilibrium constraints	4
Supply chain flexibility with link disruptions	4
On the inaccuracy of Pollaczek-Khinchine for spatial FCFS queues	4
Evaluating mixed-integer programming models over multiple right-hand sides	4
Cascading failures in the global financial system: A dynamical model	4
Performance bound for myopic order-up-to inventory policies under stationary demand processes	4

Fixed order scheduling with deadlines	4
Convergence rate analysis of the multiplicative gradient method for PET-type problems	4
Partitional clustering via successive transportation problems	4
Diffusion-level universality of many-server systems with concurrent service	4
Momentum and minibatch coupling for stochastic bilevel optimization with optimal sample complexity	4
An FPTAS for scheduling with resource constraints	4
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains	4
A non-monotone line-search method for minimizing functions with spurious local minima	4
Envy-free house allocation with minimum subsidy	4
The bipartite travelling salesman problem: A pyramidally solvable case	4
Population monotonic allocation schemes for the two-period economic lot-sizing games	4
Computing the worst-case due dates violations with budget uncertainty	4
Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous	4
A new sampling approach for Bayesian sample size analysis in applications of queueing models	4
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms	4
Corrigendum to “A new axiomatization of the Shapley-solidarity value for games with a coalition structure” [Oper. Res. Lett. 46 (2018) 163–167]	4
A random arrival rule for airport problems with fuzzy costs	4
Editorial Board	4
An axiomatic analysis of distributionally robust optimization with q-norm ambiguity sets for probability smoothing	4
A linear programming-based hyper local search for tuning hyperparameters	4
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem	4
Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information	3
An inexact column-and-constraint generation method to solve two-stage robust optimization problems	3
A new approach to agglomeration problems	3
Subgame perfect Nash equilibrium analysis in a two-population strategic matching queue with nonzero matching times	3
Risk-averse decision strategies for influence diagrams using rooted junction trees	3
Optimal control of queues with demand-driven discharge	3
Generalized ordinal Nash games: Variational approach	3
Expediting exact linear programming solvers via integer preserving factorization	3
Dynamic matching with teams	3
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound	3
On the strength of recursive McCormick relaxations for binary polynomial optimization	3
Finite customer-pool queues	3
On stochastic non-linear discounting	3
A note on the stability of monotone Markov chains	3
Distributionally robust stochastic optimal control	3
On the combined inverse-square effect of multiple points in multidimensional space	3
Editorial Board	3
Random assignments with uniform preferences: An impossibility result	3
A simple approximation algorithm for optimal decision tree	3
Correlated equilibrium of games with concave potential functions	3
An inexact algorithm for stochastic variational inequalities	3
Editorial Board	3
Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity	3
A blessing in disguise: Collusion equivalent phenomenon under environmental regulation	3
Choosing a consultant in a dynamic investment problem	3
A weighted method for sharing costs in highways	3
On queens and tours	3
Optimal design of vaccination policies: A case study for Newfoundland and Labrador	3
On linear threshold policies for continuous-time dynamic yield management	3
Editorial Board	3
On allocating Active Redundancies in Fail-Safe Systems	3
Optimal arrangement of servers for a tollbooth tandem queue with two heterogeneous servers	3
Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach	3
Generalization of weighted-egalitarian Shapley values	3
On the complexity of a maintenance problem for hierarchical systems	3
Exact evaluation and optimization of integer-ratio policies for stochastic one-warehouse multiple-retailer inventory systems	3
An optimal algorithm for the minimum-width cubic shell problem	3