The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58116978, #quickstatements; #temporary_batch_1704836857466 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
