- 참고
- [1] https://en.wikipedia.org/wiki/Combinatorial_optimization
[2] https://en.wikipedia.org/wiki/NP-completeness
[3] https://en.wikipedia.org/wiki/Knapsack_problem
[4] https://www.ibm.com/analytics/cplex-optimizer
[5] https://www.gurobi.com/
[6] https://www.scipopt.org/
[7] https://developers.google.com/optimization
[8] Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly, “Pointer Networks”, In Advances in Neural Information Processing Systems, 2015
[9] Irwan Bello, Hieu Pham, Quoc V. Le, Mohammad Norouzi, and Samy Bengio, “Neural Combinatorial Optimization with Reinforcement Learning”, In Workshop Proceedings of the 5th International Conference on Learning Representations, 2017
[10] Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O’Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, and Yori Zwols, “Solving Mixed Integer Programs Using Neural Networks”, arXiv, 2021
[11] Ryo Yonetani, Tatsunori Taniai, Mohammadamin Barekatain, Mai Nishimura, and Asako Kanezaki, “Path Planning using Neural A* Search”, In Proceedings of the International Conference on Machine Learning, 2021
[12] Anselm Paulus, Michal Rolinek, Vit Musil, Brandon Amos, and Georg Martius, “CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints”, In Proceedings of the International Conference on Machine Learning, 2021
[13] https://en.wikipedia.org/wiki/A*_search_algorithm
[14] https://medium.com/sinicx/path-planning-using-neural-a-search-icml-2021-ecc6f2e71b1f
[15] https://icml.cc/media/icml-2021/Slides/9055.pdf
[16] https://icml.cc/media/icml-2021/Slides/9555.pdf
[17] https://www.cvxpy.org/
