Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
NP-hard problem |
| gptkbp:alsoKnownAs |
ATSP
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:hasApplication |
gptkb:Logistics
Scheduling Routing |
| gptkbp:hasProperty |
Directed graph
Edge costs are not symmetric |
| gptkbp:hasSpecialCase |
gptkb:Generalized_TSP
|
| https://www.w3.org/2000/01/rdf-schema#label |
Asymmetric TSP
|
| gptkbp:input |
Directed weighted graph
|
| gptkbp:output |
Minimum cost Hamiltonian circuit
|
| gptkbp:prohibits |
Return to starting node
Visit each node exactly once |
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:supportsAlgorithm |
gptkb:Branch_and_bound
Heuristics Approximation algorithms Dynamic programming Integer linear programming |
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|