Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/5474
Title: | Core problems in bi-criteria {0,1}-knapsack problems | Authors: | Silva, Carlos Gomes da Clímaco, João Figueira, José Rui |
Keywords: | Bi-criteria knapsack problem; Core problem; Combinatorial optimization | Issue Date: | 2008 | Citation: | Computers & Operations Research. 35:7 (2008) 2292-2306 | Abstract: | 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 existence of such a set of variables in bi-criteria {0-1}-knapsack instances. Numerical experiments were performed on five types of {0,1}-knapsack instances. The results are presented for the supported and non-supported solutions as well as for the entire set of efficient solutions. A description of an approximate and an exact method is also presented. | URI: | https://hdl.handle.net/10316/5474 | DOI: | 10.1016/j.cor.2006.11.001 | Rights: | openAccess |
Appears in Collections: | FEUC- Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
file7aa11b3d2bf548c392ef379250eb701b.pdf | 341.76 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
21
checked on Nov 9, 2022
WEB OF SCIENCETM
Citations
17
checked on Oct 2, 2024
Page view(s)
308
checked on Oct 16, 2024
Download(s) 50
464
checked on Oct 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.