Author:
Löwens Christian,Ashraf Inaam,Gembus Alexander,Cuizon Genesis,Falkner Jonas K.,Schmidt-Thieme Lars
Publisher
Springer International Publishing
Reference21 articles.
1. Ascheuer, N., Jünger, M., Reinelt, G.: A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17(1), 61–84 (2000)
2. Bdeir, A., Boeder, S, Dernedde, T., Tkachuk, K., Falkner, J. K., Schmidt-Thieme, L. RP-DQN: an application of q-learning to vehicle routing problems. KI 2021, 3–16 (2021)
3. Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: ICLR Workshop (2017)
4. Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2), 269–305 (2010)
5. Escudero, L.F.: An inexact algorithm for the sequential ordering problem. Eur. J. Oper. Res. 37(2), 236–249 (1988)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献