A revised bound improvement sequence algorithm

DOI10.1016/0377-2217(88)90426-2zbMath0643.90062OpenAlexW2032988371MaRDI QIDQ1102193

Søren Holm, Paulo Barcia

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90426-2

zbMATH Keywords

Lagrange multipliersfixed pointscomputational resultsBound Improvement Sequence Algorithmcomputational improvement

Mathematics Subject Classification ID

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

Related Items

A bound-improving approach to discrete programming problems, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, 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
• Unnamed Item
• The bound improving sequence algorithm
• Constructive dual methods for discrete programming
• Heuristic algorithms for the multiple knapsack problem