Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models
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 reformulation...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ram Arti Publishers
2019-10-01
|
| Series: | International Journal of Mathematical, Engineering and Management Sciences |
| Subjects: | |
| Online Access: | https://www.ijmems.in/assets//90-IJMEMS-19-234-Vol.%204,%20No.%205,%201140%E2%80%931153,%202019.pdf |