Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044)
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: Solving the hierarchical Chinese postman problem as a rural postman problem. |
scientific article; zbMATH DE number 2056212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the hierarchical Chinese postman problem as a rural postman problem. |
scientific article; zbMATH DE number 2056212 |
Statements
Solving the hierarchical Chinese postman problem as a rural postman problem. (English)
0 references
14 March 2004
0 references
Parallel computing
0 references
Metaheuristics
0 references
Routing
0 references
Real-time
0 references
0.8994184136390686
0 references
0.8748782873153687
0 references
0.8475697636604309
0 references
0.8267953991889954
0 references
