The Capacitated Arc Routing Problem: Lower bounds (Q4022732)
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 98637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Capacitated Arc Routing Problem: Lower bounds |
scientific article; zbMATH DE number 98637 |
Statements
The Capacitated Arc Routing Problem: Lower bounds (English)
0 references
17 January 1993
0 references
Chinese postman
0 references
capacitated arc routing problem
0 references
minimum total cost
0 references
lower bounds
0 references
minimum cost perfect matching
0 references
vehicle capacity
0 references
0.935248076915741
0 references
0.9270083904266356
0 references
0.9039574265480042
0 references
0.8916523456573486
0 references
0.8915694952011108
0 references
