Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
mathematical optimization |
| gptkbp:alsoKnownAs |
Maximum edge TSP
|
| gptkbp:application |
gptkb:Logistics
Network design |
| gptkbp:complexity |
gptkb:NP-hard
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bottleneck TSP
|
| gptkbp:input |
Weighted complete graph
|
| gptkbp:introducedIn |
1968
|
| gptkbp:objective |
Minimize the length of the longest edge in the tour
|
| gptkbp:output |
gptkb:Hamiltonian_cycle
|
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
Bottleneck assignment problem Bottleneck spanning tree |
| gptkbp:solvableInPolynomialTime |
If edge weights satisfy triangle inequality
|
| gptkbp:solvedBy |
Heuristics
Binary search on edge weights Matching algorithms |
| gptkbp:studiedBy |
Gilbert and Pollak
|
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|