Core problems in bi-criteria {0,1}-knapsack problems
The most efficient algorithms for solving the single-criterion {0,1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existenc...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2008
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/5474 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/5474 |