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

DOI10.1080/10556780902992837MaRDI QIDQ3562403zbMATH OpenOpenAlexFDO

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

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-price and Dantzig-Wolfe decompositionmixed integer programmingproduction planning

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Period decompositions for the capacitated lot sizing problem with setup times
• Hybrid methods for lot sizing on parallel machines

Cited in

(19)

• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
• The green capacitated multi-item lot sizing problem with parallel machines
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Dantzig-Wolfe decomposition for the facility location and production planning problem
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Hybrid methods for lot sizing on parallel machines
• Period decompositions for the capacitated lot sizing problem with setup times
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
• Predictive search for capacitated multi-item lot sizing problems
• Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
• Multi-item capacitated lot-sizing problems with setup times and pricing decisions
• New construction heuristic for capacitated lot sizing problems
• A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562403)