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 2020-11-01 to 2024-11-01.)

Article	Citations
Complexity of training ReLU neural network	33
Penalty and partitioning techniques to improve performance of QUBO solvers	28
Single-machine scheduling with maintenance activities and rejection	19
Hardness results for Multimarginal Optimal Transport problems	12
Integer programming in parameterized complexity: Five miniatures	11
A cut-and-branch algorithm for the Quadratic Knapsack Problem	8
EXPEDIS: An exact penalty method over discrete sets	7
An exact cutting plane method for k-submodular function maximizatio	6
Principled deep neural network training through linear programming	6
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem	5
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	5
On the edge capacitated Steiner tree problem	5
Network reliability in hamiltonian graphs	5
On bin packing with clustering and bin packing with delays	5
An improved zig zag approach for competitive group testing	4
BDD-based optimization for the quadratic stable set problem	4
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine	4
The Aα	4
Packing strong subgraph in digraphs	4
The Bipartite Boolean Quadric Polytope	4
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint	3
Stable allocations and partially ordered sets	3
A column generation approach to the discrete barycenter problem	3
Node-based valid inequalities for the optimal transmission switching problem	3
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	3

Minimum energy configurations on a toric lattice as a quadratic assignment problem	3
Strong IP formulations need large coefficients	3
Block-structured integer programming: Can we parameterize without the largest coefficient?	3
Quality of equilibria for selfish bin packing with cost sharing variants	3
Mathematical formulations and solution methods for the uncapacitated r	3
Arc-routing for winter road maintenance	2
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem	2
On the analysis of optimization problems in arc-dependent networks	2
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes	2
A polyhedral study of lifted multicuts	2
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	2
Approximating single- and multi-objective nonlinear sum and product knapsack problems	2
Maximizing the Mostar index for bipartite graphs and split graphs	2
A convex cover for closed unit curves has area at least 0.1	2
The polytope of binary sequences with bounded variation	2
Fast constructive and improvement heuristics for edge clique covering	2
On the intrinsic volumes of intersections of congruent balls	2
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem	2