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...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Masar Al-Rabeeah, Elias Munapo, Ali Al-Hasani, Santosh Kumar, Andrew Eberhard
Formato:	Artigo
Idioma:	Inglês
Publicado em:	Ram Arti Publishers 2019-10-01
coleção:	International Journal of Mathematical, Engineering and Management Sciences
Assuntos:	Reformulation Branch and bound General linear integer programs Knapsack problem Bi-objective models Non-dominated point set
Acesso em linha:	https://www.ijmems.in/assets//90-IJMEMS-19-234-Vol.%204,%20No.%205,%201140%E2%80%931153,%202019.pdf
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!