Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413)
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 5544753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting sparsity in pricing routines for the capacitated arc routing problem |
scientific article; zbMATH DE number 5544753 |
Statements
Exploiting sparsity in pricing routines for the capacitated arc routing problem (English)
0 references
17 April 2009
0 references
arc routing
0 references
column generation
0 references
branch-cut-and-price
0 references
0 references
0.8527208566665649
0 references
0.8509859442710876
0 references
0.8427828550338745
0 references
0.8297441005706787
0 references
0.8294414281845093
0 references
