Boolean lexicographic optimization: algorithms & applications

Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality crit...

ver descrição completa

Detalhes bibliográficos
Autores: Marques-Silva, Joao, Argelich Romà, Josep, Graça, Ana, Lynce, Inês
Formato: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2011
País:España
Recursos:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10459.1/57277
Acesso em linha:https://doi.org/10.1007/s10472-011-9233-2
http://hdl.handle.net/10459.1/57277
Access Level:acceso abierto
Palavra-chave:Boolean optimization
Lexicographic optimization
Maximum satisfiability
Pseudo-Boolean optimization
id ES_2a65ce775d6ea35e2ba4afd8f8e180fe
oai_identifier_str oai:recercat.cat:10459.1/57277
network_acronym_str ES
network_name_str España
repository_id_str
spelling Boolean lexicographic optimization: algorithms & applicationsMarques-Silva, JoaoArgelich Romà, JosepGraça, AnaLynce, InêsBoolean optimizationLexicographic optimizationMaximum satisfiabilityPseudo-Boolean optimizationMulti-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum Satisfiability (MaxSAT), Pseudo-Boolean Optimization (PBO), or Integer Linear Programming (ILP). Experimental results, obtained on problem instances from haplotyping with pedigrees and software package dependencies, show that the proposed algorithms can provide significant performance gains over state of the art MaxSAT, PBO and ILP algorithms. Finally, the paper also shows that lexicographic optimization conditions are observed in the majority of the problem instances from the MaxSAT evaluations, motivating the development of dedicated algorithms that can exploit lexicographic optimization conditions in general MaxSAT problem instances.This work was partially funded by SFI PI Grant 09/IN.1/I2618, EU grants FP7-ICT-217069 and FP7-ICT-214898, FCT grant ATTEST (CMU-PT/ELE/0009/2009), FCT PhD grant SFRH/BD/ 28599/2006, CICYT Projects TIN2009-14704-C03-01 and TIN2010-20967-C04-03, and by INESC-ID multiannual funding from the PIDDAC program funds.Springer Verlag2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionhttps://doi.org/10.1007/s10472-011-9233-2http://hdl.handle.net/10459.1/57277reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésMICINN/PN2008-2011/TIN2009-14704-C03-01MICINN/PN2008-2011/TIN2010-20967-C04-03Versió postprint del document publicat a https://doi.org/10.1007/s10472-011-9233-2Annals of Mathematics and Artificial Intelligence, 2011, vol. 62, núm. 3, p. 317-343info:eu-repo/grantAgreement/EC/FP7/217069info:eu-repo/grantAgreement/EC/FP7/214898(c) Springer Science+Business Media B.V., 2011info:eu-repo/semantics/openAccessoai:recercat.cat:10459.1/572772026-05-29T05:05:01Z
dc.title.none.fl_str_mv Boolean lexicographic optimization: algorithms & applications
title Boolean lexicographic optimization: algorithms & applications
spellingShingle Boolean lexicographic optimization: algorithms & applications
Marques-Silva, Joao
Boolean optimization
Lexicographic optimization
Maximum satisfiability
Pseudo-Boolean optimization
title_short Boolean lexicographic optimization: algorithms & applications
title_full Boolean lexicographic optimization: algorithms & applications
title_fullStr Boolean lexicographic optimization: algorithms & applications
title_full_unstemmed Boolean lexicographic optimization: algorithms & applications
title_sort Boolean lexicographic optimization: algorithms & applications
dc.creator.none.fl_str_mv Marques-Silva, Joao
Argelich Romà, Josep
Graça, Ana
Lynce, Inês
author Marques-Silva, Joao
author_facet Marques-Silva, Joao
Argelich Romà, Josep
Graça, Ana
Lynce, Inês
author_role author
author2 Argelich Romà, Josep
Graça, Ana
Lynce, Inês
author2_role author
author
author
dc.subject.none.fl_str_mv Boolean optimization
Lexicographic optimization
Maximum satisfiability
Pseudo-Boolean optimization
topic Boolean optimization
Lexicographic optimization
Maximum satisfiability
Pseudo-Boolean optimization
description Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum Satisfiability (MaxSAT), Pseudo-Boolean Optimization (PBO), or Integer Linear Programming (ILP). Experimental results, obtained on problem instances from haplotyping with pedigrees and software package dependencies, show that the proposed algorithms can provide significant performance gains over state of the art MaxSAT, PBO and ILP algorithms. Finally, the paper also shows that lexicographic optimization conditions are observed in the majority of the problem instances from the MaxSAT evaluations, motivating the development of dedicated algorithms that can exploit lexicographic optimization conditions in general MaxSAT problem instances.
publishDate 2011
dc.date.none.fl_str_mv 2011
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1007/s10472-011-9233-2
http://hdl.handle.net/10459.1/57277
url https://doi.org/10.1007/s10472-011-9233-2
http://hdl.handle.net/10459.1/57277
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv MICINN/PN2008-2011/TIN2009-14704-C03-01
MICINN/PN2008-2011/TIN2010-20967-C04-03
Versió postprint del document publicat a https://doi.org/10.1007/s10472-011-9233-2
Annals of Mathematics and Artificial Intelligence, 2011, vol. 62, núm. 3, p. 317-343
info:eu-repo/grantAgreement/EC/FP7/217069
info:eu-repo/grantAgreement/EC/FP7/214898
dc.rights.none.fl_str_mv (c) Springer Science+Business Media B.V., 2011
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) Springer Science+Business Media B.V., 2011
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer Verlag
publisher.none.fl_str_mv Springer Verlag
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405066100736000
score 15,81155

Registos relacionados