Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem |
scientific article; zbMATH DE number 5710527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem |
scientific article; zbMATH DE number 5710527 |
Statements
Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (English)
0 references
21 May 2010
0 references
production planning
0 references
mixed integer programming
0 references
branch-and-price and Dantzig-Wolfe decomposition
0 references
0.880558431148529
0 references
0.8429825305938721
0 references
0.8429825305938721
0 references
0.840934157371521
0 references
0.8325616717338562
0 references
