A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem-Reference-Cited by-同舟云学术

A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

Published:2002-01 Issue:1 Volume:13 Page:71-78
ISSN:0960-0779
Container-title:Chaos, Solitons & Fractals
language:en
Short-container-title:Chaos, Solitons & Fractals

Author:

Likas Aristidis,Paschos Vangelis Th

Publisher

Elsevier BV

Subject

General Mathematics,General Physics and Astronomy,Statistical and Nonlinear Physics,Applied Mathematics

Reference11 articles.

1. Arora S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of FOCS'96; 1996. p. 2–11

2. Christofides N. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, CMU; 1976

3. Computers and intractability. A guide to the theory of NP-completeness;Garey,1979

4. New insertion and post-optimization procedures for the traveling salesman problem;Gendreau;Oper Res,1992

5. Johnson DS. Local optimization and the traveling salesman problem. In: Goos G, Hartmanis J, editors. Proceedings of ICALP'90, Lecture Notes in Computer Science, Vol. 443. Springer: EATCS; 1990. p. 446–61

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Multi-Robot Mission Planner by Means of Beam Search Approach and 2-Opt Local Search;2023 9th International Conference on Control, Decision and Information Technologies (CoDIT);2023-07-03

2. A new algorithm for finding the shortest paths using PCNNs;Chaos, Solitons & Fractals;2007-08