Kenshin Abe

Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero

2019 · arXiv (Cornell University)

There have been increasing challenges to solve combinatorial optimization problems by machine learning. Khalil et al. proposed an end-to-end reinforcement learning framework, S2V-DQN, which automatically learns graph embeddings to construct solutions to a wide range …