Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts

DOI10.1287/OPRE.42.4.657MaRDI QIDQ4319754zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg

Publication date 22 June 1997

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.42.4.657

zbMATH Keywords

Benders decompositioncross decompositionLagrangian relaxationlower boundssubgradient optimization

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• On the convergence of cross decomposition
• scientific article; zbMATH DE number 2154248
• Mean value cross decomposition applied to integer programming problems

Cited in

(8)

• Mean value cross decomposition applied to integer programming problems
• A multi-product loading problem: A model and solution method
• Towards strong duality in integer programming
• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• scientific article; zbMATH DE number 3989093 (Why is no real title available?)
• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• scientific article; zbMATH DE number 2154248 (Why is no real title available?)
• On the convergence of cross decomposition

This page was built for publication: Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts

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