traveling salesman problem (optimization version)
GPTKB entity
Statements (49)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:alsoKnownAs |
TSP (optimization version)
|
| gptkbp:application |
logistics
DNA sequencing circuit design |
| gptkbp:category |
optimization
graph theory algorithmic problem |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:definedIn |
the problem of finding the shortest possible route that visits each city exactly once and returns to the origin city
|
| gptkbp:famousInstance |
gptkb:TSPLIB
ATT48 |
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:formedBy |
1930s
|
| gptkbp:hasApproximationRatio |
3/2 (for metric TSP, Christofides' algorithm)
|
| https://www.w3.org/2000/01/rdf-schema#label |
traveling salesman problem (optimization version)
|
| gptkbp:input |
weighted complete graph
|
| gptkbp:notableFor |
Christofides' algorithm
Held-Karp algorithm Lin-Kernighan heuristic nearest neighbor algorithm |
| gptkbp:openProblem |
existence of a polynomial-time algorithm for general TSP
|
| gptkbp:output |
minimum-weight Hamiltonian cycle
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle_problem
gptkb:vehicle_routing_problem gptkb:Chinese_postman_problem traveling salesman problem (decision version) |
| gptkbp:solvedBy |
dynamic programming
heuristics approximation algorithms branch and bound brute-force search |
| gptkbp:usedIn |
gptkb:astronomy
genomics manufacturing robotics route planning scheduling network design data clustering tour planning delivery routing PCB manufacturing drilling optimization microchip design |
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|