Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems.
Feidiao YangTiancheng JinTie-Yan LiuXiaoming SunJialin ZhangPublished in: ACML (2018)
Keyphrases
- np hard problems
- dynamic programming
- neural network
- knapsack problem
- combinatorial search
- graph coloring
- constraint programming
- np hard
- pattern recognition
- artificial neural networks
- learning algorithm
- search heuristics
- linear programming
- state space
- integer programming
- timetabling problem
- combinatorial optimization
- search algorithm