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 2021-05-01 to 2025-05-01.)

Article	Citations
A theoretical justification of the set covering greedy heuristic of Caprara et al.	45
An improved greedy algorithm for stochastic online scheduling on unrelated machines	37
Secretary and online matching problems with machine learned advice	13
The packing number of cubic graphs	11
Approximation schemes for Min-Sum k-Clustering	9
Editorial Board	8
Editorial Board	7
Editorial Board	6
Hardness results for Multimarginal Optimal Transport problems	6
On cut polytopes and graph minors	6
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723	6
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	5
Submodular reassignment problem for reallocating agents to tasks with synergy effects	5
Facets of the dynamic monopoly polytope: Linear ordering formulation	5
Packing strong subgraph in digraphs	5
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	5
Circuits in extended formulations	4
Two-set inequalities for the binary knapsack polyhedra	4
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes	4
Exact values of defective Ramsey numbers in graph classes	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
Editorial Board	4
On Pareto optimal balanced exchanges	4
Hard problems on box-totally dual integral polyhedra	4

Circuit and Graver walks and linear and integer programming	3
Constructing extremal triangle-free graphs using integer programming	3
LP-based approximation for uniform capacitated facility location problem	3
Approximating single- and multi-objective nonlinear sum and product knapsack problems	3
Approximate separable multichoice optimization over monotone systems	2
Editorial Board	2
The polytope of binary sequences with bounded variation	2
Penalty and partitioning techniques to improve performance of QUBO solvers	2
BDD-based optimization for the quadratic stable set problem	2
An exact cutting plane method for k-submodular function maximizatio	2
On the Rényi–Ulam game with restricted size queries	2
Preface: Optimization and Discrete Geometry	2
Minimum energy configurations on a toric lattice as a quadratic assignment problem	2
More on online weighted edge coloring	2