Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The adjacency relation on the traveling salesman polytope is NP-Complete (1978)
    Springer
    Mathematical programming 14 (1978), S. 312-324 
    Details
    ISSN: 1436-4646
    Keywords: Traveling Salesman Problem ; Traveling Salesman Polytope ; Adjacent Tours ; Neighborhood Search ; NP-Complete Problems ; Hamiltonian Circuits
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588973
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...