The bound improving sequence algorithm

DOI10.1016/0167-6377(85)90047-1MaRDI QIDQ1061001zbMATH OpenOpenAlexFDO

Authors Paulo Barcia

Publication date 1985

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(85)90047-1

zbMATH Keywords

knapsack problemduality gapLagrangean relaxationComputational experiencesequence of bounds

Mathematics Subject Classification ID

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

Recommendations

• A revised bound improvement sequence algorithm
• The bounded simplex method to solve the 0-1 linear integer programming problem
• Constructive dual methods for discrete programming
• scientific article; zbMATH DE number 4199965
• scientific article; zbMATH DE number 1069803

Cites work

• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• A bound-improving approach to discrete programming problems
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Cited in

(8)

• A survey of algorithms for the generalized assignment problem
• The bounded simplex method to solve the 0-1 linear integer programming problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• Constructive dual methods for discrete programming
• A revised bound improvement sequence algorithm
• A bound-improving approach to discrete programming problems
• Data dependent worst case bound improving techniques in zero-one programming

This page was built for publication: The bound improving sequence algorithm

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