The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain experts to engage in trial-and-error heuristic design. The long-standing endeavor of design automation has gained new momentum with the rise of large language models (LLMs).
The key challenge is that the existing literature has only focused on designing algorithms with minimalcomputation, ignoring the fact that the practical latency can also be influenced byscheduling strategiesand hardware properties.