Divide and conquer strategies for parallel TSP heuristics (Q1919776): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(95)00066-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978177608 / rank | |||
Normal rank | |||
Revision as of 01:46, 20 March 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
