Learning Combinatorial Optimization Algorithms over Graphs
Abstract
解决NP-hard问题通常需要大量的专业知识和反复试验, learn algorithm to automate this challenging, tedious process. learn heuristic algorithm利用结构特征解决问题. (same structure but differ in the data)的性质,
RL + graph embedding (incrementally constructs a solution)
how good the graph embedding network capturing the current state of the solution.决定了整个model的action .
该framework can be applied to a diverse range of optimization problems over graphs.
Introduction
传统解决np-hard graph optimization problem 又三种flavors:
- exact algorithms (enumeration or branch-and-bound) (缺点: difficult for large instance)
- polynomial-time approximation a