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.
Publication Year: 1990
Publication Date: 1990-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 8
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot