Learning-Augmented Combinatorial Solvers: A Solver-Architecture Taxonomy

This paper presents a solver-architecture taxonomy of machine-learning and reinforcement-learning interventions in combinatorial solving. Rather than treating learning-augmented solving as a collection of isolated applications, we organize existing methods according to the solver-level decisions they influence, including propagation, branching, conflict analysis, restart control, structural analysis, and formulation-level reasoning. The discussion focuses on SAT/CDCL, Lazy Clause … Read more

COIL: A Deep Architecture for Column Generation

Column generation is a popular method to solve large-scale linear programs with an exponential number of variables. Several important applications, such as the vehicle routing problem, rely on this technique in order to be solved. However, in practice, column generation methods suffer from slow convergence (i.e. they require too many iterations). Stabilization techniques, which carefully … Read more