Solving NP-Hard Problems on Graphs by Reinforcement Learning without Domain Knowledge.
Kenshin AbeZijian XuIssei SatoMasashi SugiyamaPublished in: CoRR (2019)
Keyphrases
- np hard problems
- domain knowledge
- reinforcement learning
- combinatorial search
- graph coloring
- np hard
- constraint programming
- knapsack problem
- subgraph isomorphism
- combinatorial optimization
- state space
- graph structure
- graph databases
- dynamic programming
- optimal policy
- genetic programming
- graph model
- genetic algorithm