Heuristics for the black and white traveling salesman problem (Q1869887)
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: Heuristics for the black and white traveling salesman problem |
scientific article; zbMATH DE number 1902962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for the black and white traveling salesman problem |
scientific article; zbMATH DE number 1902962 |
Statements
Heuristics for the black and white traveling salesman problem (English)
0 references
28 April 2003
0 references
Traveling salesman problem
0 references
Heuristics
0 references
telecommunication network design
0 references
aircraft maintenance stops
0 references
0.9274587631225586
0 references
0.8812116384506226
0 references
0.844067394733429
0 references
0.8124618530273438
0 references
0.7717646360397339
0 references
