The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/01966324.1987.10737208 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021646400 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Networks and vehicle routing for municipal waste collection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel insert method for the capacitated arc routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Capacitated arc routing problems / rank | |||
Normal rank | |||
Latest revision as of 09:51, 18 June 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
