Constructive dual methods for discrete programming

DOI10.1016/0166-218X(87)90014-XzbMath0642.90078MaRDI QIDQ1101341

Paulo Barcia

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

relaxation approximationknapsack problemsdiscrete programmingconstructive dual methodsno duality gapreduction of the feasibility set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items

A bound-improving approach to discrete programming problems, A revised bound improvement sequence algorithm, Improved Lagrangean decomposition: An application to the generalized assignment problem

Uses Software

• Algorithm 37

Cites Work

• Unnamed Item
• The bound improving sequence algorithm
• An algorithm for the solution of the 0-1 knapsack problem
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• A bound-improving approach to discrete programming problems
• An Algorithm for Large Zero-One Knapsack Problems
• A Convergent Duality Theory for Integer Programming