Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero
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 of problems. To improve the gener...
Saved in:
Main Authors | , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
28.05.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!