An implicit branch-and-bound algorithm for mixed-integer-linear programming

Youling Lin, Larry M. Austin, James R. Burns

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


We present a B&B algorithm for solving the general mixed-integer-linear programming model (MILP). The algorithm, herein referred to as the implicit branch-and-bound algorithm (IBBA), avoids the shortcomings of computer round-off error and excessive storage requirements from which usual B&B algorithms suffer. In its present form, the algorithm is effective but not yet efficient.

Original languageEnglish
Pages (from-to)457-464
Number of pages8
JournalComputers and Operations Research
Issue number5
StatePublished - 1990


Dive into the research topics of 'An implicit branch-and-bound algorithm for mixed-integer-linear programming'. Together they form a unique fingerprint.

Cite this