A column generation approach for the bi-objective max-min knapsack problem
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 pr...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/17165 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/17165 |