Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:26, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exploiting sparsity in pricing routines for the capacitated arc routing problem |
scientific article |
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