Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
From MaRDI portal
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)
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
This page was built for publication: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
