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...
Main Author: | |
---|---|
Other Authors: | , |
Format: | article |
Language: | eng |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10316/5474 |
Country: | Portugal |
Oai: | oai:estudogeral.sib.uc.pt:10316/5474 |