Funder
Horizon 2020
Rob4Ind4.0
European Regional Development Fund
Grant Agency of the Czech Technical University in Prague
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference51 articles.
1. Abeledo H, Fukasawa R, Pessoa A, Uchoa E (2010) The time dependent traveling salesman problem: Polyhedra and branch-cut-and-price algorithm. In: Festa P (ed) Experimental algorithms. Springer, Berlin, pp 202–213
2. Abeledo H, Fukasawa R, Pessoa A, Uchoa E (2013) The time dependent traveling salesman problem: polyhedra and algorithm. Math Program Comput 5(1):27–55
3. Aiex RM, Resende MG, Ribeiro CC (2002) Probability distribution of solution time in GRASP: an experimental investigation. J Heuristics 8(3):343–373
4. Archer A, Blasiak A (2010) Improved approximation algorithms for the minimum latency problem via prize-collecting strolls. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, pp 429–447
5. Archer A, Williamson DP (2003) Faster approximation algorithms for the minimum latency problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp 88–96
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献