Dantzig-Wolfe and Lagrangian decompositions in integer linear programming

DOI10.1504/IJMOR.2012.046686zbMath1251.90268OpenAlexW2066787028MaRDI QIDQ1758875

Anass Nagih, Lucas Létocart, Nora Touati Moungla

Publication date: 16 November 2012

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2012.046686

zbMATH Keywords

Lagrangian relaxationcolumn generationDantzig-Wolfe decompositionknapsack problemLagrangian decomposition0-1 bidimensionalgeneralised assignment problemLR

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation

This page was built for publication: Dantzig-Wolfe and Lagrangian decompositions in integer linear programming