Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models
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.
Keywords: Reformulation, Branch and bound, General linear integer programs, Knapsack problem, Bi-objective models, Non-dominated point set.
Category 1: Applications -- OR and Management Sciences
Category 2: Other Topics (Multi-Criteria Optimization )
Citation: International Journal of Mathematical, Engineering and Management Sciences Vol. 4, No. 5, 1140–1153, 2019 https://dx.doi.org/10.33889/IJMEMS.2019.4.5-090
Entry Submitted: 08/13/2019
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|