Publisher
Springer Nature Switzerland
Reference48 articles.
1. Ahmed, R., Turja, M.A., Sahneh, F.D., Ghosh, M., Hamm, K., Kobourov, S.: Computing Steiner trees using graph neural networks. arXiv preprint arXiv:2108.08368 (2021)
2. Ammar, A., Bennaceur, H., Châari, I., Koubâa, A., Alajlan, M.: Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft. Comput. 20(10), 4149–4171 (2016). https://doi.org/10.1007/s00500-015-1750-1
3. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45(5), 753–782 (1998)
4. Barrett, T., Lvovsky, A., Clements, W., Foerster, J.: Exploratory combinatorial optimization with reinforcement learning. In: AAAI 2020–34th AAAI Conference on Artificial Intelligence, pp. 3243–3250 (2020)
5. Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. ArXiv: abs/1611.09940 (2017)