Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7625353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for solving the heterogeneous Chinese postman problem |
scientific article; zbMATH DE number 7625353 |
Statements
Approximation algorithms for solving the heterogeneous Chinese postman problem (English)
0 references
29 November 2022
0 references
combinatorial optimization
0 references
nonuniform speeds
0 references
heterogeneous Chinese postman tours
0 references
approximation algorithms
0 references
0 references
0.9871697425842284
0 references
0.7946441173553467
0 references
0.7881174683570862
0 references
