AN IMPLICIT BRANCH-AND-BOUND ALGORITHM FOR MIXED-INTEGER-LINEAR PROGRAMMING

被引：8

作者：

LIN, YL ^{[1
]}

AUSTIN, LM ^{[1
]}

BURNS, JR ^{[1
]}

机构：

[1] TEXAS TECH UNIV,COLL BUSINESS ADM,BOX 4320,LUBBOCK,TX 79409

来源：

COMPUTERS & OPERATIONS RESEARCH | 1990年 / 17卷 / 05期

关键词：

D O I：

10.1016/0305-0548(90)90050-H

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. © 1990.

引用

页码：457 / 464

页数：8

共 15 条

[1] AN ADVANCED DUAL ALGORITHM WITH CONSTRAINT RELAXATION FOR ALL-INTEGER PROGRAMMING [J].

AUSTIN, LM ;

GHANDFOROUSH, P .

NAVAL RESEARCH LOGISTICS, 1983, 30 (01) :133-143

[2] THE MIXED CUTTING PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

AUSTIN, LM ;

RUPAREL, BC .

COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (04) :395-401

[3]

AUSTIN LM, 1978, UNPUB MONOGRAPH TEXA

[4] A TREE-SEARCH ALGORITHM FOR MIXED INTEGER PROGRAMMING-PROBLEMS [J].

DAKIN, RJ .

COMPUTER JOURNAL, 1965, 8 (03) :250-253

[5] A PRIMAL-DUAL CUTTING-PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

GHANDFOROUSH, P ;

AUSTIN, LM .

NAVAL RESEARCH LOGISTICS, 1981, 28 (04) :559-566

[6]

GHANDFOROUSH P, 1980, THESIS TEXAS TECH U

[7]

Gomory R.E., 1958, B AM MATH SOC, V64, P275, DOI DOI 10.1090/S0002-9904-1958-10224-4

[8] AN ADVANCED START ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

HANNA, ME ;

AUSTIN, LM .

COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (03) :301-309

[9]

HILLIER FS, 1986, INTRO OPERATIONS RES, P274

[10] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].

LAND, AH ;

DOIG, AG .

ECONOMETRICA, 1960, 28 (03) :497-520

← 1 2 →