OOIR: Observatory of International Research

Papers

(The TQCC of Discrete Optimization 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-01-01 to 2026-01-01.)

Article	Citations
A theoretical justification of the set covering greedy heuristic of Caprara et al.	55
Optimal partitions of the flat torus into parts of smaller diameter	48
An improved greedy algorithm for stochastic online scheduling on unrelated machines	13
A criterion space search feasibility pump heuristic for solving maximum multiplicative programs	12
The packing number of cubic graphs	12
Approximation schemes for Min-Sum k-Clustering	11
Editorial Board	8
Editorial Board	8
Editorial Board	7
On cut polytopes and graph minors	7
Secretary and online matching problems with machine learned advice	7
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723	6
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	6
Packing strong subgraph in digraphs	5
Submodular reassignment problem for reallocating agents to tasks with synergy effects	5
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	5
Two-set inequalities for the binary knapsack polyhedra	5
On Pareto optimal balanced exchanges	4
LP-based approximation for uniform capacitated facility location problem	4
Penalty and partitioning techniques to improve performance of QUBO solvers	4
Hard problems on box-totally dual integral polyhedra	4
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	4
EPTAS for load balancing problem on parallel machines with a non-renewable resource	4
Constructing extremal triangle-free graphs using integer programming	4
Approximating single- and multi-objective nonlinear sum and product knapsack problems	4

Circuits in extended formulations	4
Circuit and Graver walks and linear and integer programming	4
Editorial Board	4
Editorial Board	4
BDD-based optimization for the quadratic stable set problem	3
Minimum energy configurations on a toric lattice as a quadratic assignment problem	3
Approximate separable multichoice optimization over monotone systems	3
Preface: Optimization and Discrete Geometry	3