IEEE - Institute of Electrical and Electronics Engineers, Inc. - A parallel adaptive tabu search approach for traveling salesman problems

Proceedings of the 2005 12th IEEE International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE '05)

Author(s): Yi He ; Yuhui Qiu ; Guangyuan Liu ; Kaiyou Lei
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 2005
Conference Location: Wuhan, China, China
Conference Date: 30 October 2005
Page(s): 796 - 801
ISBN (Paper): 0-7803-9361-9
DOI: 10.1109/NLPKE.2005.1598845
Regular:

TSP (traveling salesman problem) is one of the typical combinatorial optimization problems, which is NP-hard. It is widely believed that there is no efficient polynomial time algorithm that can... View More

Advertisement