ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

The adjacency relation on the traveling salesman polytope is NP-Complete (1978)

Papadimitriou, Christos H.

Springer

Mathematical programming 14 (1978), S. 312-324

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1436-4646

Schlagwort(e): Traveling Salesman Problem ; Traveling Salesman Polytope ; Adjacent Tours ; Neighborhood Search ; NP-Complete Problems ; Hamiltonian Circuits

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract We consider the problem of determining whether two traveling salesman tours correspond to non-adjacent vertices of the convex polytope associated with the traveling salesman problem. This problem is shown to be NP-Complete for both the symmetric and nonsymmetric traveling salesman problem. Several implications are discussed.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01588973

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer