Core problems in bi-criteria {0,1}-knapsack problems

Detalhes bibliográficos
Autor(a) principal: Silva, Carlos Gomes da
Data de Publicação: 2008
Outros Autores: Clí­maco, João, Figueira, José Rui
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/5474
https://doi.org/10.1016/j.cor.2006.11.001
Resumo: 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.
id RCAP_fc7bfff51fef4944312ba9f2e5037b18
oai_identifier_str oai:estudogeral.uc.pt:10316/5474
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Core problems in bi-criteria {0,1}-knapsack problemsBi-criteria knapsack problemCore problemCombinatorial optimizationThe 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.http://www.sciencedirect.com/science/article/B6VC5-4MVDVS6-1/1/1971d650079575b73a5ca85280ad1b062008info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleaplication/PDFhttp://hdl.handle.net/10316/5474http://hdl.handle.net/10316/5474https://doi.org/10.1016/j.cor.2006.11.001engComputers & Operations Research. 35:7 (2008) 2292-2306Silva, Carlos Gomes daClí­maco, JoãoFigueira, José Ruiinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-11-06T16:48:55Zoai:estudogeral.uc.pt:10316/5474Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:45:39.490159Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Core problems in bi-criteria {0,1}-knapsack problems
title Core problems in bi-criteria {0,1}-knapsack problems
spellingShingle Core problems in bi-criteria {0,1}-knapsack problems
Silva, Carlos Gomes da
Bi-criteria knapsack problem
Core problem
Combinatorial optimization
title_short Core problems in bi-criteria {0,1}-knapsack problems
title_full Core problems in bi-criteria {0,1}-knapsack problems
title_fullStr Core problems in bi-criteria {0,1}-knapsack problems
title_full_unstemmed Core problems in bi-criteria {0,1}-knapsack problems
title_sort Core problems in bi-criteria {0,1}-knapsack problems
author Silva, Carlos Gomes da
author_facet Silva, Carlos Gomes da
Clí­maco, João
Figueira, José Rui
author_role author
author2 Clí­maco, João
Figueira, José Rui
author2_role author
author
dc.contributor.author.fl_str_mv Silva, Carlos Gomes da
Clí­maco, João
Figueira, José Rui
dc.subject.por.fl_str_mv Bi-criteria knapsack problem
Core problem
Combinatorial optimization
topic Bi-criteria knapsack problem
Core problem
Combinatorial optimization
description 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.
publishDate 2008
dc.date.none.fl_str_mv 2008
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/5474
http://hdl.handle.net/10316/5474
https://doi.org/10.1016/j.cor.2006.11.001
url http://hdl.handle.net/10316/5474
https://doi.org/10.1016/j.cor.2006.11.001
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Computers & Operations Research. 35:7 (2008) 2292-2306
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv aplication/PDF
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1817554112373325824