Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Margara L. Traveling Salesman Problem and local search. In: Applied Mathematics Letters, vol. 5 (4) pp. 69 - 71. Pergamon, 1992.
It has been shown that certain NP-complete problems, i.e., TSP, min cut, and graph partitioning, with specific notions of neighborhood, satisfy a simple difference equation. In this paper, we extend these results by proving that TSP with some notions of neighborhood satisfy such a difference equation. Furthermore, we derive some structural properties satisfied by the above-mentioned problem.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional