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

Article	Citations
On the pure fixed charge transportation problem	35
Node-based valid inequalities for the optimal transmission switching problem	33
On the length of L-Grundy sequences	12
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem	11
On polytopes with linear rank with respect to generalizations of the split closure	8
A theoretical justification of the set covering greedy heuristic of Caprara et al.	8
When greedy gives optimal: A unified approach	6
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	6
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem	5
Submodular reassignment problem for reallocating agents to tasks with synergy effects	5
The Aα	5
EXPEDIS: An exact penalty method over discrete sets	5
The optimal proper connection number of a graph with given independence number	5
Exact values of defective Ramsey numbers in graph classes	4
Graphs with equal Grundy domination and independence number	4
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles	4
Two-set inequalities for the binary knapsack polyhedra	4
Reachability in choice networks	4
Mathematical formulations and solution methods for the uncapacitated r	4
Corrigendum to “A polyhedral study of lifted multicuts” [Discrete Optim. 47 (2023) 100757]	4
Maximizing the Mostar index for bipartite graphs and split graphs	4
Anchor-robust project scheduling with non-availability periods	3
An improved greedy algorithm for stochastic online scheduling on unrelated machines	3
Integer points in the degree-sequence polytope	3
Packing mixed hyperarborescences	3

Editorial Board	3
Complexity of training ReLU neural network	2
On the general Z-type index of connected graphs	2
Finding the dimension of a non-empty orthogonal array polytope	2
Editorial Board	2
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique	2
On Pareto optimal balanced exchanges	2
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes	2
On the intrinsic volumes of intersections of congruent balls	2
Circuits in extended formulations	2
EPTAS for load balancing problem on parallel machines with a non-renewable resource	2
On bin packing with clustering and bin packing with delays	2