An Experimental Investigation of Iterated Local Search for Coloring Graphs. - Luís Paquete; Thomas Stützle (EvoWorkshops, 2002)

A Racing Algorithm for Configuring Metaheuristics. - Mauro Birattari; Thomas Stützle; Luís Paquete; Klaus Varrentrapp (GECCO, 2002)

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. - 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 (PATAT, 2002)

A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. - Luís Paquete; Thomas Stützle (EMO, 2003)

Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. - Luís Paquete; Marco Chiarandini; Thomas Stützle (Metaheuristics for Multiobjective Optimisation, 2004)

On the Design of ACO for the Biobjective Quadratic Assignment Problem. - Manuel López-Ibáñez 001; Luís Paquete; Thomas Stützle (ANTS Workshop, 2004)

Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (PPSN, 2004)

Exploring the Performance of Stochastic Multiobjective Optimisers with the Second-Order Attainment Function. - Carlos M. Fonseca; Viviane Grunert da Fonseca; Luís Paquete (EMO, 2005)

An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator. - Carlos M. Fonseca; Luís Paquete; Manuel López-Ibáñez 001 (IEEE Congress on Evolutionary Computation, 2006)

A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. - Luís Paquete; Thomas Stützle (Eur. J. Oper. Res., 2006)

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (J. Math. Model. Algorithms, 2006)

Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem. - Manuel López-Ibáñez 001; Luís Paquete; Thomas Stützle (J. Math. Model. Algorithms, 2006)

Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems. - Luís Paquete; Thomas Stützle; Manuel López-Ibáñez 001 (Metaheuristics, 2007)

On local optima in multiobjective combinatorial optimization problems. - Luís Paquete; Tommaso Schiavinotto; Thomas Stützle (Ann. Oper. Res., 2007)

Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization. - Luís Paquete; Thomas Stützle (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Heuristic algorithms for Hadamard matrices with two circulant cores. - Marco Chiarandini; Ilias S. Kotsireas; Christos Koukouvinos; Luís Paquete (Theor. Comput. Sci., 2008)

Design and analysis of stochastic local search for the multiobjective traveling salesman problem. - Luís Paquete; Thomas Stützle (Comput. Oper. Res., 2009)

Erik D. Demaine and Joseph O'Rouke, Review of Geometric Folding Algorithms: Linkages, Origami, Polyhedra , Cambridge University Press (2007). - Luís Paquete (Eur. J. Oper. Res., 2009)

On the Complexity of Computing the Hypervolume Indicator. - Nicola Beume; Carlos M. Fonseca; Manuel López-Ibáñez 001; Luís Paquete; Jan Vahrenhold (IEEE Trans. Evol. Comput., 2009)

Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization. - Manuel López-Ibáñez 001; Luís Paquete; Thomas Stützle (Experimental Methods for the Analysis of Optimization Algorithms, 2010)

Introduction. - Thomas Bartz-Beielstein; Marco Chiarandini; Luís Paquete; Mike Preuss (Experimental Methods for the Analysis of Optimization Algorithms, 2010)

Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization]. - Manuel López-Ibáñez 001; Thomas Stützle; Luís Paquete (GECCO (Companion), 2010)

On a particular case of the multi-criteria unconstrained optimization problem. - Jochen Gorski; Luís Paquete (Electron. Notes Discret. Math., 2010)

On the Performance of Local Search for the Biobjective Traveling Salesman Problem. - Luís Paquete; Thomas Stützle (Advances in Multi-Objective Nature Inspired Computing, 2010)

On the Computation of the Empirical Attainment Function. - Carlos M. Fonseca; Andreia P. Guerreiro; Manuel López-Ibáñez 001; Luís Paquete (EMO, 2011)

Connectedness and Local Search for Bicriteria Knapsack Problems. - Arnaud Liefooghe; Luís Paquete; Marco Simões; José Rui Figueira (EvoCOP, 2011)

Dynamic Programming for a Biobjective Search Problem in a Line. - Luís Paquete; Mathias Jaschob; Kathrin Klamroth; Jochen Gorski (COCOA, 2012)

On Beam Search for Multicriteria Combinatorial Optimization Problems. - Aníbal Ponte; Luís Paquete; José Rui Figueira (CPAIOR, 2012)

Increasing student commitment in introductory programming learning. - António José Mendes; Luís Paquete; Amílcar Cardoso; Anabela Gomes (FIE, 2012)

Greedy algorithms for a class of knapsack problems with binary weights. - Jochen Gorski; Luís Paquete; Fábio Pedrosa (Comput. Oper. Res., 2012)

Improvements on bicriteria pairwise sequence alignment: algorithms and applications. - Maryam Abbasi; Luís Paquete; Arnaud Liefooghe; Miguel Pinheiro; Pedro Matias 001 (Bioinform., 2013)

Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. - José Rui Figueira; Luís Paquete; Marco Simões; Daniel Vanderpooten (Comput. Optim. Appl., 2013)

On Local Search for Bi-objective Knapsack Problems. - Arnaud Liefooghe; Luís Paquete; José Rui Figueira (Evol. Comput., 2013)

On a biobjective search problem in a line: Formulations and algorithms. - Luís Paquete; Mathias Jaschob; Kathrin Klamroth; Jochen Gorski (Theor. Comput. Sci., 2013)

A note on the ϵ-indicator subset selection. - Daniel Vaz 001; Luís Paquete; Aníbal Ponte (Theor. Comput. Sci., 2013)

MOSAL: software tools for multiobjective sequence alignment. - Luís Paquete; Pedro Matias 001; Maryam Abbasi; Miguel Pinheiro (Source Code Biol. Medicine, 2014)

Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming. - Arnaud Liefooghe; Sébastien Vérel; Luís Paquete; Jin-Kao Hao (EMO (1), 2015)

A proficient high level programming program as a way to overcome unemployment among graduates. - Maria José Marcelino; Bruno Cabral 001; Luís Paquete; António José Mendes (FIE, 2015)

Greedy Hypervolume Subset Selection in the Three-Objective Case. - Andreia P. Guerreiro; Carlos M. Fonseca; Luís Paquete (GECCO, 2015)

Local Search for Multiobjective Multiple Sequence Alignment. - Maryam Abbasi; Luís Paquete; Francisco B. Pereira (IWBBIO (2), 2015)

Representation of the non-dominated set in biobjective discrete optimization. - Daniel Vaz 001; Luís Paquete; Carlos M. Fonseca; Kathrin Klamroth; Michael Stiglmayr (Comput. Oper. Res., 2015)

Greedy Hypervolume Subset Selection in Low Dimensions. - Andreia P. Guerreiro; Carlos M. Fonseca; Luís Paquete (Evol. Comput., 2016)

Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms. - Tobias Kuhn; Carlos M. Fonseca; Luís Paquete; Stefan Ruzika; Miguel Duarte; José Rui Figueira (Evol. Comput., 2016)

Bi-dimensional knapsack problems with one soft constraint. - Britta Schulze; Luís Paquete; Kathrin Klamroth; José Rui Figueira (Comput. Oper. Res., 2017)

Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review. - Luís Paquete; Thomas Stützle (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Dominance, epsilon, and hypervolume local optimal sets in multi-objective optimization, and how to tell the difference. - Arnaud Liefooghe; Manuel López-Ibáñez 001; Luís Paquete; Sébastien Vérel (GECCO, 2018)

Compressed data structures for bi-objective {0, 1}-knapsack problems. - Pedro Correia; Luís Paquete; José Rui Figueira (Comput. Oper. Res., 2018)

Implicit enumeration strategies for the hypervolume subset selection problem. - Ricardo J. Gomes; Andreia P. Guerreiro; Tobias Kuhn; Luís Paquete (Comput. Oper. Res., 2018)

Finding representations for an unconstrained bi-objective combinatorial optimization problem. - Alexandre D. Jesus; Luís Paquete; José Rui Figueira (Optim. Lett., 2018)

An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms. - Gonçalo Lopes; João Paulo Fernandes; Luís Paquete (CEFP, 2019)

Optimization of Service Placement with Fairness. - Noé Godinho; Marília Curado; Luís Paquete (ISCC, 2019)

Guiding under uniformity measure in the decision space. - Gladston Moreira; Luís Paquete (LA-CCI, 2019)

A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. - Noé Godinho; Luís Paquete (SEA², 2019)

Algorithm selection of anytime algorithms. - Alexandre D. Jesus; Arnaud Liefooghe; Bilel Derbel; Luís Paquete (GECCO, 2020)

Energy and Latency-aware Resource Reconfiguration in Fog Environments. - Noé Godinho; Henrique Silva 001; Marília Curado; Luís Paquete (NCA, 2020)

A Rank-based Mechanism for Service Placement in the Fog. - Karima Velasquez; David Perez Abreu; Luís Paquete; Marília Curado; Edmundo Monteiro (Networking, 2020)

Resilient Service Chains through Smart Replication. - David Perez Abreu; Karima Velasquez; Luís Paquete; Marília Curado; Edmundo Monteiro (IEEE Access, 2020)

The Hypervolume Indicator: Problems and Algorithms. - Andreia P. Guerreiro; Carlos M. Fonseca; Luís Paquete (CoRR, 2020)

On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. - Britta Schulze; Michael Stiglmayr; Luís Paquete; Carlos M. Fonseca; David Willems; Stefan Ruzika (Math. Methods Oper. Res., 2020)

A software library for archiving nondominated points. - Duarte M. Dias; Alexandre D. Jesus; Luís Paquete (GECCO Companion, 2021)

On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization. - Alexandre D. Jesus; Luís Paquete; Bilel Derbel; Arnaud Liefooghe (GECCO, 2021)

Replicability and reproducibility in evolutionary optimization. - Luís Paquete; Manuel López-Ibáñez 001 (GECCO Companion, 2021)

Finding multi-objective supported efficient spanning trees. - Pedro Correia; Luís Paquete; José Rui Figueira (Comput. Optim. Appl., 2021)

Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensions. - Carola Doerr; Luís Paquete (CoRR, 2021)

A model of anytime algorithm performance for bi-objective optimization. - Alexandre D. Jesus; Luís Paquete; Arnaud Liefooghe (J. Glob. Optim., 2021)

Reproducibility in Evolutionary Computation. - Manuel López-Ibáñez 001; Jürgen Branke; Luís Paquete (ACM Trans. Evol. Learn. Optim., 2021)

Decision space robustness for multi-objective integer linear programming. - Michael Stiglmayr; José Rui Figueira; Kathrin Klamroth; Luís Paquete; Britta Schulze (Ann. Oper. Res., 2022)

Computing representations using hypervolume scalarizations. - Luís Paquete; Britta Schulze; Michael Stiglmayr; Ana C. Lourenço (Comput. Oper. Res., 2022)

The Hypervolume Indicator: Computational Problems and Algorithms. - Andreia P. Guerreiro; Carlos M. Fonseca; Luís Paquete (ACM Comput. Surv., 2022)

A reconfigurable resource management framework for fog environments. - Noé Godinho; Henrique Silva 001; Marília Curado; Luís Paquete (Future Gener. Comput. Syst., 2022)

Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions. - François Clément; Carola Doerr; Luís Paquete (J. Complex., 2022)

An Empirical Study on the Use of Quantum Computing for Financial Portfolio Optimization. - Cláudio Gomes 003; Gabriel Falcão 001; Luís Paquete; João Paulo Fernandes (SN Comput. Sci., 2022)

Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms. - François Clément; Diederick Vermetten; Jacob de Nobel; Alexandre D. Jesus; Luís Paquete; Carola Doerr (GECCO, 2023)

Constructing Optimal L∞ Star Discrepancy Sets. - François Clément; Carola Doerr; Kathrin Klamroth; Luís Paquete (CoRR, 2023)

Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms - Code and Data. - François Clément; Diederick Vermetten; Jacob de Nobel; Alexandre D. Jesus; Luís Paquete; Carola Doerr (Zenodo, 2023)

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (CoRR, 2024)

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem. - François Clément; Carola Doerr; Kathrin Klamroth; Luís Paquete (CoRR, 2024)

Editorial for the Special Issue on Reproducibility. - Manuel López-Ibáñez 001; Luís Paquete; Mike Preuss (Evol. Comput., 2024)

Heuristic approaches to obtain low-discrepancy point sets via subset selection. - François Clément; Carola Doerr; Luís Paquete (J. Complex., 2024)

Special issue on exact and approximation methods for mixed-integer multi-objective optimization. - Carlos Henggeler Antunes; Carlos M. Fonseca; Luís Paquete; Michael Stiglmayr (Math. Methods Oper. Res., 2024)

A Path-Relinking-based Heuristic for the Multiobjective Subgraph Problem. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (GECCO, 2025)

A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization. - Gonçalo Lopes; Kathrin Klamroth; Luís Paquete (Comput. Oper. Res., 2025)

Solving the Multiobjective Quasi-clique Problem. - Daniela Scherer dos Santos; Kathrin Klamroth; Pedro Martins 002; Luís Paquete (Eur. J. Oper. Res., 2025)

An algorithm for improving lower bounds in dynamic time warping. - Yuqi Luo; Xinyi Fang; Wei Ke 001; Chan-Tong Lam; Sio Kei Im; Luís Paquete (Expert Syst. Appl., 2025)

Introduction to the "Best of GECCO 2023" Special Issue. - Luís Paquete; Sara Silva (ACM Trans. Evol. Learn. Optim., 2025)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization. - Felipe O. Mota; Luís Paquete; Daniel Vanderpooten (CoRR, 2025)