Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems.
作者： Tie-Yan Liu , Jialin Zhang , Xiaoming Sun , Feidiao Yang , Tiancheng Jin
DOI:
关键词: Boosting (machine learning) 、 Computer science 、 Artificial intelligence 、 Dynamic programming 、 Artificial neural network
摘要:
参考文章(9)
Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Introduction to Algorithms, third edition ,(2009)
Michael Held, Richard M. Karp, A Dynamic Programming Approach to Sequencing Problems Journal of The Society for Industrial and Applied Mathematics. ,vol. 10, pp. 196- 210 ,(1962) , 10.1137/0110015
Kurt Hornik, Approximation capabilities of multilayer feedforward networks Neural Networks. ,vol. 4, pp. 251- 257 ,(1991) , 10.1016/0893-6080(91)90009-T
Nicos Christofides, Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem ,(1976)
A.G. Barto, R.S. Sutton, Reinforcement Learning: An Introduction ,(1988)
Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, Stig Petersen, Charles Beattie, Amir Sadik, Ioannis Antonoglou, Helen King, Dharshan Kumaran, Daan Wierstra, Shane Legg, Demis Hassabis, None, Human-level control through deep reinforcement learning Nature. ,vol. 518, pp. 529- 533 ,(2015) , 10.1038/NATURE14236
Gerhard Reinelt, TSPLIB—A Traveling Salesman Problem Library Informs Journal on Computing. ,vol. 3, pp. 376- 384 ,(1991) , 10.1287/IJOC.3.4.376
Anton Milan, Ian Reid, Anthony Dick, S. Hamid Rezatofighi, Ravi Garg, Data-driven approximations to NP-hard problems national conference on artificial intelligence. pp. 1453- 1459 ,(2017)
Vijay V. Vazirani, Approximation Algorithms ,(2001)