default search action
Andreia P. Guerreiro
Person information
- affiliation: INESC-ID, Universidade de Lisboa, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce
, Vasco Manquinho
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153: 106153 (2023) - [p2]Bekir Afsar
Many-Objective Quality Measures. Many-Criteria Optimization and Decision Analysis 2023: 113-148 - [p1]Andreia P. Guerreiro, Kathrin Klamroth
Theoretical Aspects of Subset Selection in Multi-Objective Optimisation. Many-Criteria Optimization and Decision Analysis 2023: 213-239 - 2022
- [j6]Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
The Hypervolume Indicator: Computational Problems and Algorithms. ACM Comput. Surv. 54(6): 119:1-119:42 (2022) - [i2]Andreia P. Guerreiro, João Cortes
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR abs/2204.06908 (2022) - 2021
- [j5]Andreia P. Guerreiro, Vasco Manquinho
Exact hypervolume subset selection through incremental computations. Comput. Oper. Res. 136: 105471 (2021) - 2020
- [j4]Andreia P. Guerreiro
An analysis of the Hypervolume Sharpe-Ratio Indicator. Eur. J. Oper. Res. 283(2): 614-629 (2020) - [i1]Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete:
The Hypervolume Indicator: Problems and Algorithms. CoRR abs/2005.00515 (2020)
2010 – 2019
- 2019
- [c7]Andreia P. Guerreiro
Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving. CP 2019: 232-250 - 2018
- [j3]Ricardo J. Gomes, Andreia P. Guerreiro
Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Oper. Res. 100: 244-253 (2018) - [j2]Andreia P. Guerreiro
Computing and Updating Hypervolume Contributions in Up to Four Dimensions. IEEE Trans. Evol. Comput. 22(3): 449-463 (2018) - 2016
- [j1]Andreia P. Guerreiro
Greedy Hypervolume Subset Selection in Low Dimensions. Evol. Comput. 24(3): 521-544 (2016) - [c6]Andreia P. Guerreiro
Hypervolume Sharpe-Ratio Indicator: Formalization and First Theoretical Results. PPSN 2016: 814-823 - [c5]Carola Doerr
Tutorials at PPSN 2016. PPSN 2016: 1012-1022 - 2015
- [c4]Andreia P. Guerreiro
Greedy Hypervolume Subset Selection in the Three-Objective Case. GECCO 2015: 671-678 - 2014
- [c3]Iryna Yevseyeva, Andreia P. Guerreiro, Michael T. M. Emmerich
A Portfolio Optimization Approach to Selection in Multiobjective Evolutionary Algorithms. PPSN 2014: 672-681 - 2012
- [c2]Andreia P. Guerreiro, Carlos M. Fonseca, Michael T. M. Emmerich:
A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four Dimensions. CCCG 2012: 77-82 - 2011
- [c1]Carlos M. Fonseca
On the Computation of the Empirical Attainment Function. EMO 2011: 106-120
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: