A hybrid heuristic for the multiple choice multidimensional knapsack problem
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/25060 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/25060 |