The bound improving sequence algorithm

DOI10.1016/0167-6377(85)90047-1zbMath0568.90065OpenAlexW2080552811MaRDI QIDQ1061001

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

Lagrangean relaxationduality gapknapsack problemComputational experiencesequence of bounds

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, Constructive dual methods for discrete programming, A revised bound improvement sequence algorithm, Improved Lagrangean decomposition: An application to the generalized assignment problem, The multidimensional 0-1 knapsack problem: an overview., A survey of algorithms for the generalized assignment problem

Cites Work

• Unnamed Item
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• A bound-improving approach to discrete programming problems