Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference22 articles.
1. Approximation algorithms for the geometric covering salesman problem;Arkin;Discrete Appl. Math.,1994
2. An integer-programming-based approach to the close-enough traveling salesman problem;Behdani;INFORMS J. Comput.,2014
3. Improving search in genetic algorithms;Booker;Genet. Algorithms Simul. Annealing,1987
4. Improved upper and lower bounds for the close enough traveling salesman problem;Carrabs,2017
5. A novel discretization scheme for the close enough traveling salesman problem;Carrabs;Comput. Oper. Res.,2017
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献