Please use this identifier to cite or link to this item: http://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
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: http://hdl.handle.net/10316/5474
Rights: openAccess
Appears in Collections:FEUC- Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
file7aa11b3d2bf548c392ef379250eb701b.pdf341.76 kBAdobe PDFView/Open
Show full item record

Page view(s)

133
checked on Aug 21, 2019

Download(s) 50

275
checked on Aug 21, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.