Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models
Masar Al-Rabeeah, Elias Munapo, Ali Al-Hasani and 2 more
International Journal of Mathematical, Engineering and Management Sciences · 2019
doi:10.33889/ijmems.2019.4.5-090 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, a reformulation that was proposed for a knapsack problem has been extended to single and bi-objective linear integer programs. A further reformulation by adding an upper bound constraint for a knapsack problem is also proposed and extended to the bi-objective case. These reformulations significantly reduce the number of branch and bound iterations with respect to these models. Numerical illustrations have been presented and computational experiments have been carried out to compare the behaviour before and after the reformulation. For this purpose, Tora software was used.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.