Accelerating Exact Combinatorial Optimization via RL-based Initialization -- A Case Study in Scheduling

Jiaqi Yin, Cunxi Yu

Scheduling on dataflow graphs (also known as computation graphs) is an NP-hard problem. The traditional exact methods are limited by runtime complexity, while reinforcement learnin…