A bound-improving approach to discrete programming problems

DOI10.1007/BF01581146zbMath0816.90105MaRDI QIDQ1340059

V. Pereyra

Publication date: 11 December 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Lagrangean dualitybound-improving sequence

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Constructive dual methods for discrete programming, The bound improving sequence algorithm

Cites Work

• Improved Lagrangean decomposition: An application to the generalized assignment problem
• The bound improving sequence algorithm
• Constructive dual methods for discrete programming
• A revised bound improvement sequence algorithm