Luís Paquete

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 45

Top Topics

Combinatorial Optimization

Knapsack Problem

Subset Selection

Top Venues

Comput. Oper. Res.

Publications

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete
Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. CoRR (2024)
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 (2024)
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete
Solving the Multiobjective Quasi-Clique Problem. CoRR (2024)
Manuel López-Ibáñez, Luís Paquete, Mike Preuss
Editorial for the Special Issue on Reproducibility. Evol. Comput. 32 (1) (2024)
François Clément, Carola Doerr, Luís Paquete
Heuristic approaches to obtain low-discrepancy point sets via subset selection. J. Complex. 83 (2024)
François Clément, Carola Doerr, Luís Paquete
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection. CoRR (2023)
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 (2023)
François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete
Star Discrepancy Sets. CoRR (2023)
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)
François Clément, Carola Doerr, Luís Paquete
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions. J. Complex. 70 (2022)
Luís Paquete, Britta Schulze, Michael Stiglmayr, Ana C. Lourenço
Computing representations using hypervolume scalarizations. Comput. Oper. Res. 137 (2022)
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) (2022)
Noé Godinho, Henrique Silva, Marília Curado, Luís Paquete
A reconfigurable resource management framework for fog environments. Future Gener. Comput. Syst. 133 (2022)
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) (2022)
Pedro Correia, Luís Paquete, José Rui Figueira
Finding multi-objective supported efficient spanning trees. Comput. Optim. Appl. 78 (2) (2021)
Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
The Hypervolume Indicator: Computational Problems and Algorithms. ACM Comput. Surv. 54 (6) (2021)
Manuel López-Ibáñez, Jürgen Branke, Luís Paquete
Reproducibility in Evolutionary Computation. CoRR (2021)
Carola Doerr, Luís Paquete
Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensions. CoRR (2021)
Luís Paquete, Manuel López-Ibáñez
Replicability and reproducibility in evolutionary optimization. GECCO Companion (2021)
Manuel López-Ibáñez, Jürgen Branke, Luís Paquete
Reproducibility in Evolutionary Computation. ACM Trans. Evol. Learn. Optim. 1 (4) (2021)
Duarte M. Dias, Alexandre D. Jesus, Luís Paquete
A software library for archiving nondominated points. GECCO Companion (2021)
Alexandre D. Jesus, Luís Paquete, Arnaud Liefooghe
A model of anytime algorithm performance for bi-objective optimization. J. Glob. Optim. 79 (2) (2021)
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)
David Perez Abreu, Karima Velasquez, Luís Paquete, Marília Curado, Edmundo Monteiro
Resilient Service Chains through Smart Replication. IEEE Access 8 (2020)
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)
Noé Godinho, Henrique Silva, Marília Curado, Luís Paquete
Energy and Latency-aware Resource Reconfiguration in Fog Environments. NCA (2020)
Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
The Hypervolume Indicator: Problems and Algorithms. CoRR (2020)
Alexandre D. Jesus, Arnaud Liefooghe, Bilel Derbel, Luís Paquete
Algorithm selection of anytime algorithms. GECCO (2020)
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) (2020)
Noé Godinho, Luís Paquete
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. SEA² (2019)
Gonçalo Lopes, João Paulo Fernandes, Luís Paquete
An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms. CEFP (2019)
Noé Godinho, Marília Curado, Luís Paquete
Optimization of Service Placement with Fairness. ISCC (2019)
Gladston Moreira, Luís Paquete
Guiding under uniformity measure in the decision space. LA-CCI (2019)
Alexandre D. Jesus, Luís Paquete, José Rui Figueira
Finding representations for an unconstrained bi-objective combinatorial optimization problem. Optim. Lett. 12 (2) (2018)
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)
Ricardo J. Gomes, Andreia P. Guerreiro, Tobias Kuhn, Luís Paquete
Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Oper. Res. 100 (2018)
Pedro Correia, Luís Paquete, José Rui Figueira
Compressed data structures for bi-objective {0, 1}-knapsack problems. Comput. Oper. Res. 89 (2018)
Britta Schulze, Luís Paquete, Kathrin Klamroth, José Rui Figueira
Bi-dimensional knapsack problems with one soft constraint. Comput. Oper. Res. 78 (2017)
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) (2016)
Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
Greedy Hypervolume Subset Selection in Low Dimensions. Evol. Comput. 24 (3) (2016)
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 (2015)
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)
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)
Maryam Abbasi, Luís Paquete, Francisco B. Pereira
Local Search for Multiobjective Multiple Sequence Alignment. IWBBIO (2) (2015)
Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
Greedy Hypervolume Subset Selection in the Three-Objective Case. GECCO (2015)
Luís Paquete, Pedro Matias, Maryam Abbasi, Miguel Pinheiro
MOSAL: software tools for multiobjective sequence alignment. Source Code Biol. Medicine 9 (2014)
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) (2013)
Maryam Abbasi, Luís Paquete, Arnaud Liefooghe, Miguel Pinheiro, Pedro Matias
Improvements on bicriteria pairwise sequence alignment: algorithms and applications. Bioinform. 29 (8) (2013)
Arnaud Liefooghe, Luís Paquete, José Rui Figueira
On Local Search for Bi-objective Knapsack Problems. Evol. Comput. 21 (1) (2013)
Luís Paquete, Mathias Jaschob, Kathrin Klamroth, Jochen Gorski
On a biobjective search problem in a line: Formulations and algorithms. Theor. Comput. Sci. 507 (2013)
Daniel Vaz, Luís Paquete, Aníbal Ponte
A note on the ϵ-indicator subset selection. Theor. Comput. Sci. 499 (2013)
Jochen Gorski, Luís Paquete, Fábio Pedrosa
Greedy algorithms for a class of knapsack problems with binary weights. Comput. Oper. Res. 39 (3) (2012)
Aníbal Ponte, Luís Paquete, José Rui Figueira
On Beam Search for Multicriteria Combinatorial Optimization Problems. CPAIOR (2012)
Luís Paquete, Mathias Jaschob, Kathrin Klamroth, Jochen Gorski
Dynamic Programming for a Biobjective Search Problem in a Line. COCOA (2012)
António José Mendes, Luís Paquete, Amílcar Cardoso, Anabela Gomes
Increasing student commitment in introductory programming learning. FIE (2012)
Arnaud Liefooghe, Luís Paquete, Marco Simões, José Rui Figueira
Connectedness and Local Search for Bicriteria Knapsack Problems. EvoCOP (2011)
Carlos M. Fonseca, Andreia P. Guerreiro, Manuel López-Ibáñez, Luís Paquete
On the Computation of the Empirical Attainment Function. EMO (2011)
Jochen Gorski, Luís Paquete
On a particular case of the multi-criteria unconstrained optimization problem. Electron. Notes Discret. Math. 36 (2010)
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)
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) (2009)
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) (2009)
Luís Paquete, Thomas Stützle
Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput. Oper. Res. 36 (9) (2009)
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) (2008)
Luís Paquete, Tommaso Schiavinotto, Thomas Stützle
On local optima in multiobjective combinatorial optimization problems. Ann. Oper. Res. 156 (1) (2007)
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) (2006)
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) (2006)
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)
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) (2006)
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)
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)
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)
Luís Paquete, Thomas Stützle
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. EMO (2003)
Mauro Birattari, Thomas Stützle, Luís Paquete, Klaus Varrentrapp
A Racing Algorithm for Configuring Metaheuristics. GECCO (2002)
Luís Paquete, Thomas Stützle
An Experimental Investigation of Iterated Local Search for Coloring Graphs. EvoWorkshops (2002)
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)