Author:
Barbato Michele,Grappe Roland,Lacroix Mathieu,Wolfler Calvo Roberto
Publisher
Springer International Publishing
Reference25 articles.
1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)
2. Barbato, M., Grappe, R., Lacroix, M., Wolfler Calvo, R.: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. Discrete Optim. 21, 25–41 (2016)
3. Borndörfer, R.: Aspects of set packing, partitioning, and covering. Doctoral dissertation, Ph. D. thesis, Technischen Universität Berlin, Berlin, Germany (1998)
4. Lecture Notes in Computer Science;S Borne,2012
5. Carrabs, F., Cerulli, R., Speranza, M.G.: A branch-and-bound algorithm for the double travelling salesman with two stacks. Networks 61, 58–75 (2013)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献