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

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

doi:10.1016/0305-0548(90)90050-H

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

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

Business Administration

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

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 language	English
Pages (from-to)	457-464
Number of pages	8
Journal	Computers and Operations Research
Volume	17
Issue number	5
DOIs	https://doi.org/10.1016/0305-0548(90)90050-H
State	Published - 1990

Access to Document

10.1016/0305-0548(90)90050-H

Cite this

@article{5e3a4157961b4fce9f879fa30cb4412a,

title = "An implicit branch-and-bound algorithm for mixed-integer-linear programming",

abstract = "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.",

author = "Youling Lin and Austin, {Larry M.} and Burns, {James R.}",

year = "1990",

doi = "10.1016/0305-0548(90)90050-H",

language = "English",

volume = "17",

pages = "457--464",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "5",

}

TY - JOUR

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

AU - Lin, Youling

AU - Austin, Larry M.

AU - Burns, James R.

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025538057&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(90)90050-H

DO - 10.1016/0305-0548(90)90050-H

M3 - Article

AN - SCOPUS:0025538057

SN - 0305-0548

VL - 17

SP - 457

EP - 464

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 5

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this