Author:
Kulich Miroslav,Vidašič Jan,Mikula Jan
Publisher
Springer International Publishing
Reference17 articles.
1. Alatartsev, S., Augustine, M., Ortmeier, F.: Constricting insertion heuristic for traveling salesman problem with neighborhoods. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS-2013). AAAI (2013)
2. Alatartsev, S., Mersheeva, V., Augustine, M., Ortmeier, F.: On optimizing a sequence of robotic tasks. In: Proceedings of the International Conference on Intelligent Robots and Systems (IROS). IEEE (2013)
3. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Concorde TSP Solver (2010)
4. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197–218 (1994)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition, 3rd edn. The MIT Press (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献