Author:
Soroka A. G.,Mikhelson G. V.,Mescheryakov A. V.,Gerasimov S. V.
Reference21 articles.
1. Bestuzheva, K., Besancon, M., Wei-Kun Chen, et al., The SCIP Optimization Suite 8.0, Technical
Report, Optimization Online, 2021. http://www.optimization-online.org/DB_HTML/2021/12/8728.html.
2. Helsgaun, K., An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, European Journal of Operational Research, Elsevier Publ., 2000, vol. 126, no. 1, pp. 106–130.
3. Perron, L., Operations Research and Constraint Programming at Google, International Conference on Principles and Practice of Constraint Programming, Springer, 2011, p. 2.
4. Falkner, J.K. and Schmidt-Thieme, L., Learning to Solve Vehicle Routing Problems with Time Windows Through Joint Attention, arXiv preprint arXiv:2006.09100, 2020.
5. Laporte, G. and Nobert, Y., A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem, Operations-Research-Spektrum, Springer, 1983, vol. 5, pp. 77–85.