Constructive dual methods for discrete programming

DOI10.1016/0166-218X(87)90014-XMaRDI QIDQ1101341zbMATH OpenFDO

Authors Paulo Barcia

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0166-218X(87)90014-X

zbMATH Keywords

constructive dual methodsdiscrete programmingknapsack problemsno duality gapreduction of the feasibility setrelaxation approximation

Mathematics Subject Classification ID

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

Recommendations

• A Convergent Duality Theory for Integer Programming
• scientific article; zbMATH DE number 3922373
• scientific article; zbMATH DE number 4045489
• On the complexity of the surrogate dual of 0–1 programming
• scientific article; zbMATH DE number 4023017

Cites work

• A bound-improving approach to discrete programming problems
• A Convergent Duality Theory for Integer Programming
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• An algorithm for the solution of the 0-1 knapsack problem
• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• The bound improving sequence algorithm

Cited in

(8)

• The bound improving sequence algorithm
• A revised bound improvement sequence algorithm
• A bound-improving approach to discrete programming problems
• scientific article; zbMATH DE number 4045489 (Why is no real title available?)
• A Convergent Duality Theory for Integer Programming
• scientific article; zbMATH DE number 1206049 (Why is no real title available?)
• Dual methods for discrete structural optimization problems
• Improved Lagrangean decomposition: An application to the generalized assignment problem

Describes a project that uses

Uses Software

• Algorithm 37

This page was built for publication: Constructive dual methods for discrete programming

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