Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57702228, #quickstatements; #temporary_batch_1710286847436 |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997401436 / rank | |||
Normal rank | |||
Revision as of 00:54, 20 March 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
