Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
In this article, we consider the multi-item capacitated lot sizing problem with setup times. Starting from an original mixed integer programming model, we apply the standard Dantzig–Wolfe decomposition (DWD) in two different ways: defining the subproblems by items and defining the subproblems by per...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/26823 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/26823 |