On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:42, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the refinement of bounds of heuristic algorithms for the traveling salesman problem |
scientific article |
Statements
On the refinement of bounds of heuristic algorithms for the traveling salesman problem (English)
0 references
1985
0 references
approximation
0 references
heuristics
0 references
traveling salesman
0 references
bounds
0 references
