| Article ID: | iaor19901112 |
| Country: | United Kingdom |
| Volume: | 17 |
| Start Page Number: | 457 |
| End Page Number: | 464 |
| Publication Date: | Aug 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Burns James R., Lin Youling, Austin Larry |
| Keywords: | programming: branch and bound |
The authors 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.