Publisher
Springer Nature Singapore
Reference63 articles.
1. Bellman, R.: Dynamic programming. Science 153(3731), 34–37 (1966)
2. Xu, S., Panwar, S.S., Kodialam, M., Lakshman, T.V.: Deep neural network approximated dynamic programming for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 1684–1691 (2020)
3. Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699–719 (1966)
4. Zhang, W., Sauppe, J.J., Jacobson, S.H.: Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Comput. Optim. Appl. 85(2), 369–407 (2023)
5. Donog, C.: A relaxation algorithm for solving the traveling salesman problem. Shandong Sci. 32(4), 74–79 (2019)