16 citations · 17 across the 2 of their papers we have counts for
2 papers
cs.LG2021★ 16 cited
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs
Runzhong Wang, Zhigang Hua, Gan Liu +6
Combinatorial Optimization (CO) has been a long-standing challenging research topic featured by its NP-hard nature. Traditionally such problems are approximately solved with heuris…
cs.LG2021★ 1 cited
Learning to Schedule DAG Tasks
Zhigang Hua, Feng Qi, Gan Liu +1
Scheduling computational tasks represented by directed acyclic graphs (DAGs) is challenging because of its complexity. Conventional scheduling algorithms rely heavily on simple heu…