Author:
Alfandari Laurent,Toulouse Sophie
Subject
General Computer Science,Theoretical Computer Science
Reference47 articles.
1. New approximation algorithms for (1, 2)-tsp;Adamaszek,2018
2. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks;Alba Martínez;INFORMS J. Comput.,2013
3. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
4. Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks;Barbato;Discrete Optim.,2016
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献