Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/17165
Título: | A column generation approach for the bi-objective max-min knapsack problem |
Autor(es): | Alves, Cláudio Mansi, Raid Pinto, Telmo Carvalho, J. M. Valério de |
Palavras-chave: | Integer programming Column generation Max-min knapsack problem |
Data: | 2012 |
Resumo(s): | In this paper, we propose a new approach to compute strong lower and upper bounds for the bi-objective maxmin knapsack problem. It relies on a reformulation of the problem using the Dantzig-Wolfe decomposition principle. The model resulting from this decomposition is an exponential integer linear program whose linear relaxation can be solved efficiently using a column generation procedure. We describe the details of this decomposition and the related column generation algorithm. To evaluate the performance of our approach, we conducted a set of comparative computational experiments on instances obtained with a generator described in the literature. The results obtained show that our approach outperforms other state-of-the-art methods. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/17165 |
ISBN: | 9789898425973 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: | LES/ALG - Textos completos em actas de encontros científicos internacionais com arbitragem |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
A column generation approach for the bi-objective max-min knapsack problem.pdf Acesso restrito! | 112,2 kB | Adobe PDF | Ver/Abrir |