Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:alsoKnownAs |
GTSP
|
| gptkbp:application |
logistics
routing circuit design |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describedBy |
Noon and Bean
|
| gptkbp:firstDescribed |
1979
|
| gptkbp:generalizes |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:groupCluster |
set of nodes
|
| https://www.w3.org/2000/01/rdf-schema#label |
Generalized TSP
|
| gptkbp:objective |
minimize total tour cost
|
| gptkbp:prohibits |
visit exactly one node from each cluster
|
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:solvedBy |
heuristics
metaheuristics exact algorithms |
| gptkbp:usedIn |
robotics
telecommunications vehicle routing |
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|