Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The square of every two-connected graph is Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Bottleneck Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem: An update of research / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: P-Complete Approximation Problems / rank | |||
Normal rank | |||
Latest revision as of 10:30, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guaranteed performance heuristics for the bottleneck traveling salesman problem |
scientific article |
Statements
Guaranteed performance heuristics for the bottleneck traveling salesman problem (English)
0 references
1984
0 references
bottleneck traveling salesman problem
0 references
constant-performance, polynomial- time, nonexact algorithms
0 references
minimax traveling salesman problem
0 references
biconnected graphs
0 references
heuristic
0 references
worst-case behavior
0 references
computational complexity
0 references
0 references
