Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

From MaRDI portal
Revision as of 01:56, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3562403

DOI10.1080/10556780902992837zbMath1189.90103OpenAlexW2018958887MaRDI QIDQ3562403

Carina Maria Oliveira Pimentel, Filipe Pereira e Alvelos, José M. Valério de Carvalho

Publication date: 21 May 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780902992837




Related Items (13)







This page was built for publication: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem