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
关键词
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
相关论文
共 50 条