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

DOI10.1287/opre.42.4.657zbMath0864.90095OpenAlexW2157402086MaRDI QIDQ4319754

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

Lagrangian relaxationlower boundsBenders decompositionsubgradient optimizationcross decomposition

Mathematics Subject Classification ID

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

Related Items (5)

A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts ⋮ Towards strong duality in integer programming ⋮ Mean value cross decomposition applied to integer programming problems ⋮ A multi-product loading problem: A model and solution method

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