The bound improving sequence algorithm

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


The purpose of this paper is to report on a new tool to help solve 0-1 LP's. It consists of a sequence of bounds that, under proper conditions, bridge the duality gap, i.e., converges in a finite number of steps to the optimal value of the objective function of the problem studied. As a by-product an optimal solution for that problem is produced. Computational experience is reported.

Original languageEnglish
Pages (from-to)27-30
Number of pages4
JournalOperations Research Letters
Issue number1
Publication statusPublished - 1 Jan 1985


  • 0-1
  • integer programs
  • knapsack problem
  • Lagrangean relaxation


Dive into the research topics of 'The bound improving sequence algorithm'. Together they form a unique fingerprint.

Cite this