OOIR: Observatory of International Research

Papers

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

Article	Citations
A theoretical justification of the set covering greedy heuristic of Caprara et al.	60
Optimal partitions of the flat torus into parts of smaller diameter	49
An improved greedy algorithm for stochastic online scheduling on unrelated machines	15
Editorial Board	15
A criterion space search feasibility pump heuristic for solving maximum multiplicative programs	13
Editorial Board	11
Editorial Board	10
Approximation schemes for Min-Sum k-Clustering	9
Editorial Board	8
Secretary and online matching problems with machine learned advice	7
The packing number of cubic graphs	7
On cut polytopes and graph minors	6
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	6
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723	6
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	5
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	5
Two-set inequalities for the binary knapsack polyhedra	5
Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem	5
Packing strong subgraph in digraphs	5
On Pareto optimal balanced exchanges	4
Editorial Board	4
Submodular reassignment problem for reallocating agents to tasks with synergy effects	4
EPTAS for load balancing problem on parallel machines with a non-renewable resource	4
Constructing extremal triangle-free graphs using integer programming	4
Circuits in extended formulations	4

LP-based approximation for uniform capacitated facility location problem	4
Circuit and Graver walks and linear and integer programming	4
Editorial Board	3
Approximating single- and multi-objective nonlinear sum and product knapsack problems	3
Penalty and partitioning techniques to improve performance of QUBO solvers	3
Hard problems on box-totally dual integral polyhedra	3
Preface: Optimization and Discrete Geometry	2
Approximate separable multichoice optimization over monotone systems	2
The polytope of binary sequences with bounded variation	2
Minimum energy configurations on a toric lattice as a quadratic assignment problem	2
Column (and row) generation algorithms for the pallet loading problem	2
Computational aspects of lifted cover inequalities for knapsacks with few different weights	2
BDD-based optimization for the quadratic stable set problem	2
More on online weighted edge coloring	2