Divide and conquer strategies for parallel TSP heuristics (Q1919776): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:46, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer strategies for parallel TSP heuristics |
scientific article |
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
