Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Loading Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
Revision as of 12:09, 28 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of a new heuristic for the travelling salesman problem |
scientific article |
Statements
Worst-case analysis of a new heuristic for the travelling salesman problem (English)
0 references
31 March 2022
0 references
triangularity condition
0 references
shortest spanning tree
0 references
worst-case analysis
0 references
