Discrete Optimization

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-05-01 to 2024-05-01.)
ArticleCitations
Complexity of training ReLU neural network29
Penalty and partitioning techniques to improve performance of QUBO solvers19
Single-machine scheduling with maintenance activities and rejection18
Hardness results for Multimarginal Optimal Transport problems10
Integer programming in parameterized complexity: Five miniatures10
Extended formulations for convex hulls of some bilinear functions8
EXPEDIS: An exact penalty method over discrete sets7
An exact cutting plane method for k-submodular function maximizatio6
A cut-and-branch algorithm for the Quadratic Knapsack Problem6
A maximum edge-weight clique extraction algorithm based on branch-and-bound6
On the edge capacitated Steiner tree problem5
On bin packing with clustering and bin packing with delays5
On the Balanced Minimum Evolution polytope5
Principled deep neural network training through linear programming5
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan5
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine5
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem5
The Aα4
The Bipartite Boolean Quadric Polytope4
BDD-based optimization for the quadratic stable set problem4
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem3
Network reliability in hamiltonian graphs3
The stable marriage problem with ties and restricted edges3
Strong IP formulations need large coefficients3
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint3
An improved zig zag approach for competitive group testing3
A column generation approach to the discrete barycenter problem3
Packing strong subgraph in digraphs3
Minimum energy configurations on a toric lattice as a quadratic assignment problem3
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes3
Arc-routing for winter road maintenance2
Block-structured integer programming: Can we parameterize without the largest coefficient?2
Approximating single- and multi-objective nonlinear sum and product knapsack problems2
Stable allocations and partially ordered sets2
Fast constructive and improvement heuristics for edge clique covering2
Quality of equilibria for selfish bin packing with cost sharing variants2
A convex cover for closed unit curves has area at least 0.12
The polytope of binary sequences with bounded variation2
Constant factor approximation for tracking paths and fault tolerant feedback vertex set2
Mathematical formulations and solution methods for the uncapacitated r2
0.020331144332886