A revised bound improvement sequence algorithm

DOI10.1016/0377-2217(88)90426-2zbMATH Open0643.90062OpenAlexW2032988371MaRDI QIDQ1102193FDOQ1102193

Authors: Paulo Barcia, Søren Holm 

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

Recommendations

• The bound improving sequence algorithm
• An interval branch and bound algorithm for bound constrained optimization problems
• Principles and Practice of Constraint Programming – CP 2004
• Publication:4504439
• A branch-and-bound algorithm for solving fixed charge problems

zbMATH Keywords

Lagrange multipliersfixed pointscomputational resultsBound Improvement Sequence Algorithmcomputational improvement

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Heuristic algorithms for the multiple knapsack problem
• The bound improving sequence algorithm
• Constructive dual methods for discrete programming
• Title not available (Why is that?)

Cited In (6)

• A survey of algorithms for the generalized assignment problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• The bound improving sequence algorithm
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A bound-improving approach to discrete programming problems

This page was built for publication: A revised bound improvement sequence algorithm

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