Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039)
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 5037985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for the mixed capacitated arc routing problem |
scientific article; zbMATH DE number 5037985 |
Statements
Lower and upper bounds for the mixed capacitated arc routing problem (English)
0 references
30 June 2006
0 references
capacitated arc routing problem
0 references
mixed graph
0 references
lower bound
0 references
cutting plane
0 references
heuristic
0 references
memetic algorithm
0 references
waste collection
0 references
0.8942877650260925
0 references
0.8735368847846985
0 references
0.86235111951828
0 references
0.8529347777366638
0 references
0.8521216511726379
0 references
