default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuís Paquete
Person information
- affiliation: University of Coimbra, Department of Informatics Engineering, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Manuel López-Ibáñez
, Luís Paquete, Mike Preuss:
Editorial for the Special Issue on Reproducibility. Evol. Comput. 32(1): 1-2 (2024)- [j36]François Clément, Carola Doerr, Luís Paquete:
Heuristic approaches to obtain low-discrepancy point sets via subset selection. J. Complex. 83: 101852 (2024) - [j35]Carlos Henggeler Antunes, Carlos M. Fonseca, Luís Paquete, Michael Stiglmayr:
Special issue on exact and approximation methods for mixed-integer multi-objective optimization. Math. Methods Oper. Res. 100(1): 1-4 (2024) - [i9]Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete:
Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. CoRR abs/2403.08534 (2024) - [i8]Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete:
Solving the Multiobjective Quasi-Clique Problem. CoRR abs/2403.10896 (2024) - [i7]François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete:
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem. CoRR abs/2407.11533 (2024) - 2023
- [c30]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms. GECCO 2023: 1330-1338 - [e7]Sara Silva, Luís Paquete:
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, July 15-19, 2023. ACM 2023, ISBN 979-8-4007-0119-1 [contents] - [e6]Sara Silva, Luís Paquete:
Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023. ACM 2023, ISBN 979-8-4007-0120-7 [contents] - [d1]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms - Code and Data. Zenodo, 2023
- [i6]François Clément, Carola Doerr, Luís Paquete:
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection. CoRR abs/2306.15276 (2023) - [i5]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms. CoRR abs/2306.16998 (2023) - [i4]François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete:
Constructing Optimal L∞ Star Discrepancy Sets. CoRR abs/2311.17463 (2023) - 2022
- [j34]Michael Stiglmayr, José Rui Figueira, Kathrin Klamroth, Luís Paquete, Britta Schulze:
Decision space robustness for multi-objective integer linear programming. Ann. Oper. Res. 319(2): 1769-1791 (2022) - [j33]Luís Paquete, Britta Schulze, Michael Stiglmayr, Ana C. Lourenço:
Computing representations using hypervolume scalarizations. Comput. Oper. Res. 137: 105349 (2022) - [j32]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) - [j31]Noé Godinho, Henrique Silva, Marília Curado, Luís Paquete:
A reconfigurable resource management framework for fog environments. Future Gener. Comput. Syst. 133: 124-140 (2022) - [j30]François Clément, Carola Doerr, Luís Paquete:
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions. J. Complex. 70: 101645 (2022) - [j29]Cláudio Gomes, Gabriel Falcão, Luís Paquete, João Paulo Fernandes:
An Empirical Study on the Use of Quantum Computing for Financial Portfolio Optimization. SN Comput. Sci. 3(5): 335 (2022) - 2021
- [j28]Pedro Correia, Luís Paquete, José Rui Figueira:
Finding multi-objective supported efficient spanning trees. Comput. Optim. Appl. 78(2): 491-528 (2021) - [j27]Alexandre D. Jesus, Luís Paquete, Arnaud Liefooghe:
A model of anytime algorithm performance for bi-objective optimization. J. Glob. Optim. 79(2): 329-350 (2021) - [j26]Manuel López-Ibáñez, Jürgen Branke, Luís Paquete:
Reproducibility in Evolutionary Computation. ACM Trans. Evol. Learn. Optim. 1(4): 14:1-14:21 (2021) - [c29]Duarte M. Dias, Alexandre D. Jesus, Luís Paquete:
A software library for archiving nondominated points. GECCO Companion 2021: 53-54 - [c28]Alexandre D. Jesus, Luís Paquete, Bilel Derbel, Arnaud Liefooghe:
On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization. GECCO 2021: 234-242 - [c27]Luís Paquete, Manuel López-Ibáñez:
Replicability and reproducibility in evolutionary optimization. GECCO Companion 2021: 454-462 - [i3]Carola Doerr, Luís Paquete:
Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensions. CoRR abs/2101.07881 (2021) - [i2]Manuel López-Ibáñez, Jürgen Branke, Luís Paquete:
Reproducibility in Evolutionary Computation. CoRR abs/2102.03380 (2021) - 2020
- [j25]David Perez Abreu, Karima Velasquez, Luís Paquete, Marília Curado, Edmundo Monteiro:
Resilient Service Chains through Smart Replication. IEEE Access 8: 187021-187036 (2020) - [j24]Britta Schulze, Michael Stiglmayr, Luís Paquete, Carlos M. Fonseca, David Willems, Stefan Ruzika:
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. Math. Methods Oper. Res. 92(1): 107-132 (2020) - [c26]Alexandre D. Jesus, Arnaud Liefooghe, Bilel Derbel, Luís Paquete:
Algorithm selection of anytime algorithms. GECCO 2020: 850-858 - [c25]Noé Godinho, Henrique Silva, Marília Curado, Luís Paquete:
Energy and Latency-aware Resource Reconfiguration in Fog Environments. NCA 2020: 1-8 - [c24]Karima Velasquez, David Perez Abreu, Luís Paquete, Marília Curado, Edmundo Monteiro:
A Rank-based Mechanism for Service Placement in the Fog. Networking 2020: 64-72 - [e5]Luís Paquete, Christine Zarges:
Evolutionary Computation in Combinatorial Optimization - 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15-17, 2020, Proceedings. Lecture Notes in Computer Science 12102, Springer 2020, ISBN 978-3-030-43679-7 [contents] - [i1]Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete:
The Hypervolume Indicator: Problems and Algorithms. CoRR abs/2005.00515 (2020)
2010 – 2019
- 2019
- [c23]Gonçalo Lopes, João Paulo Fernandes, Luís Paquete:
An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms. CEFP 2019: 375-391 - [c22]Noé Godinho, Marília Curado, Luís Paquete:
Optimization of Service Placement with Fairness. ISCC 2019: 1-6 - [c21]Gladston Moreira, Luís Paquete:
Guiding under uniformity measure in the decision space. LA-CCI 2019: 1-6 - [c20]Noé Godinho, Luís Paquete:
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. SEA² 2019: 69-81 - [e4]Arnaud Liefooghe, Luís Paquete:
Evolutionary Computation in Combinatorial Optimization - 19th European Conference, EvoCOP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24-26, 2019, Proceedings. Lecture Notes in Computer Science 11452, Springer 2019, ISBN 978-3-030-16710-3 [contents] - 2018
- [j23]Pedro Correia, Luís Paquete, José Rui Figueira:
Compressed data structures for bi-objective {0, 1}-knapsack problems. Comput. Oper. Res. 89: 82-93 (2018) - [j22]Ricardo J. Gomes, Andreia P. Guerreiro, Tobias Kuhn, Luís Paquete:
Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Oper. Res. 100: 244-253 (2018) - [j21]Alexandre D. Jesus, Luís Paquete, José Rui Figueira:
Finding representations for an unconstrained bi-objective combinatorial optimization problem. Optim. Lett. 12(2): 321-334 (2018) - [c19]Arnaud Liefooghe, Manuel López-Ibáñez, Luís Paquete, Sébastien Vérel:
Dominance, epsilon, and hypervolume local optimal sets in multi-objective optimization, and how to tell the difference. GECCO 2018: 324-331 - [p6]Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 411-425 - [e3]Anne Auger, Carlos M. Fonseca, Nuno Lourenço, Penousal Machado, Luís Paquete, L. Darrell Whitley:
Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8-12, 2018, Proceedings, Part I. Lecture Notes in Computer Science 11101, Springer 2018, ISBN 978-3-319-99252-5 [contents] - [e2]Anne Auger, Carlos M. Fonseca, Nuno Lourenço, Penousal Machado, Luís Paquete, L. Darrell Whitley:
Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8-12, 2018, Proceedings, Part II. Lecture Notes in Computer Science 11102, Springer 2018, ISBN 978-3-319-99258-7 [contents] - 2017
- [j20]Britta Schulze, Luís Paquete, Kathrin Klamroth, José Rui Figueira:
Bi-dimensional knapsack problems with one soft constraint. Comput. Oper. Res. 78: 15-26 (2017) - 2016
- [j19]Tobias Kuhn, Carlos M. Fonseca, Luís Paquete, Stefan Ruzika, Miguel Duarte, José Rui Figueira:
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms. Evol. Comput. 24(3): 411-425 (2016) - [j18]Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete:
Greedy Hypervolume Subset Selection in Low Dimensions. Evol. Comput. 24(3): 521-544 (2016) - 2015
- [j17]Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr:
Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63: 172-186 (2015) - [c18]Arnaud Liefooghe, Sébastien Vérel, Luís Paquete, Jin-Kao Hao:
Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming. EMO (1) 2015: 171-186 - [c17]Maria José Marcelino, Bruno Cabral, Luís Paquete, António José Mendes:
A proficient high level programming program as a way to overcome unemployment among graduates. FIE 2015: 1-8 - [c16]Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete:
Greedy Hypervolume Subset Selection in the Three-Objective Case. GECCO 2015: 671-678 - [c15]Maryam Abbasi, Luís Paquete, Francisco B. Pereira:
Local Search for Multiobjective Multiple Sequence Alignment. IWBBIO (2) 2015: 175-182 - 2014
- [j16]Luís Paquete, Pedro Matias, Maryam Abbasi, Miguel Pinheiro:
MOSAL: software tools for multiobjective sequence alignment. Source Code Biol. Medicine 9: 2 (2014) - 2013
- [j15]Maryam Abbasi, Luís Paquete, Arnaud Liefooghe, Miguel Pinheiro, Pedro Matias:
Improvements on bicriteria pairwise sequence alignment: algorithms and applications. Bioinform. 29(8): 996-1003 (2013) - [j14]José Rui Figueira, Luís Paquete, Marco Simões, Daniel Vanderpooten:
Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. Comput. Optim. Appl. 56(1): 97-111 (2013) - [j13]Arnaud Liefooghe, Luís Paquete, José Rui Figueira:
On Local Search for Bi-objective Knapsack Problems. Evol. Comput. 21(1): 179-196 (2013) - [j12]Daniel Vaz, Luís Paquete, Aníbal Ponte:
A note on the ϵ-indicator subset selection. Theor. Comput. Sci. 499: 113-116 (2013) - [j11]Luís Paquete, Mathias Jaschob, Kathrin Klamroth, Jochen Gorski:
On a biobjective search problem in a line: Formulations and algorithms. Theor. Comput. Sci. 507: 61-71 (2013) - 2012
- [j10]Jochen Gorski, Luís Paquete, Fábio Pedrosa:
Greedy algorithms for a class of knapsack problems with binary weights. Comput. Oper. Res. 39(3): 498-511 (2012) - [c14]Luís Paquete, Mathias Jaschob, Kathrin Klamroth, Jochen Gorski:
Dynamic Programming for a Biobjective Search Problem in a Line. COCOA 2012: 348-359 - [c13]Aníbal Ponte, Luís Paquete, José Rui Figueira:
On Beam Search for Multicriteria Combinatorial Optimization Problems. CPAIOR 2012: 307-321 - [c12]António José Mendes, Luís Paquete, Amílcar Cardoso, Anabela Gomes:
Increasing student commitment in introductory programming learning. FIE 2012: 1-6 - 2011
- [c11]Carlos M. Fonseca, Andreia P. Guerreiro, Manuel López-Ibáñez, Luís Paquete:
On the Computation of the Empirical Attainment Function. EMO 2011: 106-120 - [c10]Arnaud Liefooghe, Luís Paquete, Marco Simões, José Rui Figueira:
Connectedness and Local Search for Bicriteria Knapsack Problems. EvoCOP 2011: 48-59 - 2010
- [j9]Jochen Gorski, Luís Paquete:
On a particular case of the multi-criteria unconstrained optimization problem. Electron. Notes Discret. Math. 36: 135-142 (2010) - [c9]Manuel López-Ibáñez, Thomas Stützle, Luís Paquete:
Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization]. GECCO (Companion) 2010: 1959-1962 - [p5]Thomas Bartz-Beielstein, Marco Chiarandini, Luís Paquete, Mike Preuss:
Introduction. Experimental Methods for the Analysis of Optimization Algorithms 2010: 1-13 - [p4]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization. Experimental Methods for the Analysis of Optimization Algorithms 2010: 209-222 - [p3]Luís Paquete, Thomas Stützle:
On the Performance of Local Search for the Biobjective Traveling Salesman Problem. Advances in Multi-Objective Nature Inspired Computing 2010: 143-165 - [e1]Thomas Bartz-Beielstein, Marco Chiarandini, Luís Paquete, Mike Preuss:
Experimental Methods for the Analysis of Optimization Algorithms. Springer 2010, ISBN 978-3-642-02537-2 [contents]
2000 – 2009
- 2009
- [j8]Luís Paquete, Thomas Stützle:
Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput. Oper. Res. 36(9): 2619-2631 (2009) - [j7]Luís Paquete:
Erik D. Demaine and Joseph O'Rouke, Review of Geometric Folding Algorithms: Linkages, Origami, Polyhedra , Cambridge University Press (2007). Eur. J. Oper. Res. 199(1): 311-313 (2009) - [j6]Nicola Beume, Carlos M. Fonseca, Manuel López-Ibáñez, Luís Paquete, Jan Vahrenhold:
On the Complexity of Computing the Hypervolume Indicator. IEEE Trans. Evol. Comput. 13(5): 1075-1082 (2009) - 2008
- [j5]Marco Chiarandini, Ilias S. Kotsireas, Christos Koukouvinos, Luís Paquete:
Heuristic algorithms for Hadamard matrices with two circulant cores. Theor. Comput. Sci. 407(1-3): 274-277 (2008) - 2007
- [j4]Luís Paquete, Tommaso Schiavinotto, Thomas Stützle:
On local optima in multiobjective combinatorial optimization problems. Ann. Oper. Res. 156(1): 83-97 (2007) - [p2]Luís Paquete, Thomas Stützle, Manuel López-Ibáñez:
Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems. Metaheuristics 2007: 325-344 - [r1]Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j3]Luís Paquete, Thomas Stützle:
A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Eur. J. Oper. Res. 169(3): 943-959 (2006) - [j2]Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto:
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. J. Math. Model. Algorithms 5(1): 91-110 (2006) - [j1]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem. J. Math. Model. Algorithms 5(1): 111-137 (2006) - [c8]Carlos M. Fonseca, Luís Paquete, Manuel López-Ibáñez:
An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator. IEEE Congress on Evolutionary Computation 2006: 1157-1163 - 2005
- [c7]Carlos M. Fonseca, Viviane Grunert da Fonseca, Luís Paquete:
Exploring the Performance of Stochastic Multiobjective Optimisers with the Second-Order Attainment Function. EMO 2005: 250-264 - 2004
- [c6]Manuel López-Ibáñez, Luís Paquete, Thomas Stützle:
On the Design of ACO for the Biobjective Quadratic Assignment Problem. ANTS Workshop 2004: 214-225 - [c5]Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto:
Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. PPSN 2004: 450-460 - [p1]Luís Paquete, Marco Chiarandini, Thomas Stützle:
Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. Metaheuristics for Multiobjective Optimisation 2004: 177-199 - 2003
- [c4]Luís Paquete, Thomas Stützle:
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. EMO 2003: 479-493 - 2002
- [c3]Luís Paquete, Thomas Stützle:
An Experimental Investigation of Iterated Local Search for Coloring Graphs. EvoWorkshops 2002: 122-131 - [c2]Mauro Birattari, Thomas Stützle, Luís Paquete, Klaus Varrentrapp:
A Racing Algorithm for Configuring Metaheuristics. GECCO 2002: 11-18 - [c1]Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luís Paquete, Thomas Stützle:
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 2002: 329-354
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 2025-01-21 00:00 CET 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:
