The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097)
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: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases |
scientific article |
Statements
The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (English)
0 references
1987
0 references
vehicle routing
0 references
Capacitated Chinese Postman Problem
0 references
NP-hard
0 references
matching- based lower bound
0 references
0.8242260813713074
0 references
0.8080146312713623
0 references
