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-02-01 to 2024-02-01.)
ArticleCitations
Complexity of training ReLU neural network24
Single-machine scheduling with maintenance activities and rejection18
Penalty and partitioning techniques to improve performance of QUBO solvers16
Integer programming in parameterized complexity: Five miniatures9
Hardness results for Multimarginal Optimal Transport problems8
EXPEDIS: An exact penalty method over discrete sets7
A cut-and-branch algorithm for the Quadratic Knapsack Problem6
A maximum edge-weight clique extraction algorithm based on branch-and-bound6
Extended formulations for convex hulls of some bilinear functions6
Linear-time algorithms for finding Hamiltonian and longest (6
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan5
An exact cutting plane method for k-submodular function maximizatio5
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem5
On the Balanced Minimum Evolution polytope5
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine5
On bin packing with clustering and bin packing with delays5
Separation of cycle inequalities in periodic timetabling5
On the edge capacitated Steiner tree problem5
The Bipartite Boolean Quadric Polytope4
The Aα4
Principled deep neural network training through linear programming4
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut4
BDD-based optimization for the quadratic stable set problem4
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint3
Strong IP formulations need large coefficients3
Network reliability in hamiltonian graphs3
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes3
The stable marriage problem with ties and restricted edges3
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem2
An improved zig zag approach for competitive group testing2
Minimum energy configurations on a toric lattice as a quadratic assignment problem2
Packing strong subgraph in digraphs2
Block-structured integer programming: Can we parameterize without the largest coefficient?2
Quality of equilibria for selfish bin packing with cost sharing variants2
A convex cover for closed unit curves has area at least 0.12
Arc-routing for winter road maintenance2
Fast constructive and improvement heuristics for edge clique covering2
A column generation approach to the discrete barycenter problem2
0.03446888923645