Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:alsoKnownAs |
mTSP
|
| gptkbp:firstDescribed |
1970s
|
| gptkbp:generalizes |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:goal |
Minimize total cost
Minimize total distance Minimize total time |
| gptkbp:hasApplication |
gptkb:Logistics
Scheduling Route planning |
| gptkbp:hasVariant |
gptkb:Vehicle_Routing_Problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Multiple TSP
|
| gptkbp:NP-hard |
true
|
| gptkbp:prohibits |
Each city visited once
Each salesman starts and ends at depot Multiple salesmen |
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:solvedBy |
gptkb:Integer_programming
gptkb:Metaheuristics Heuristics |
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|