Combines differentiable optimization with exact ILP solvers to achieve a 10x performance gain in solving NP-hard combinatorial scheduling problems.
April 1, 2026
Original Paper
Differentiable Initialization-Accelerated CPU-GPU Hybrid Combinatorial Scheduling
arXiv · 2603.28943
The Takeaway
It is the first framework to use machine learning to 'warm-start' exact classical solvers like Gurobi or CPLEX for industry-scale scheduling. This allows practitioners to solve critical resource allocation problems significantly faster while maintaining optimality guarantees.
From the abstract
This paper presents a hybrid CPU-GPU framework for solving combinatorial scheduling problems formulated as Integer Linear Programming (ILP). While scheduling underpins many optimization tasks in computing systems, solving these problems optimally at scale remains a long-standing challenge due to their NP-hard nature. We introduce a novel approach that combines differentiable optimization with classical ILP solving. Specifically, we utilize differentiable presolving to rapidly generate high-quali