Divide and conquer strategies for parallel TSP heuristics (Q1919776)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Divide and conquer strategies for parallel TSP heuristics |
scientific article; zbMATH DE number 909728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer strategies for parallel TSP heuristics |
scientific article; zbMATH DE number 909728 |
Statements
Divide and conquer strategies for parallel TSP heuristics (English)
0 references
24 July 1996
0 references
geometric traveling salesman problem
0 references
divide und conquer strategies
0 references
parallel heuristics
0 references
0 references
0 references
0 references
