Luís Paquete

Orcid: 0000-0001-7525-8901

Affiliations:
  • University of Coimbra, Department of Informatics Engineering, Portugal


According to our database1, Luís Paquete authored at least 78 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Editorial for the Special Issue on Reproducibility.
Evol. Comput., 2024

Solving the Multiobjective Quasi-Clique Problem.
CoRR, 2024

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems.
CoRR, 2024

2023
Constructing Optimal L<sub>∞</sub> Star Discrepancy Sets.
CoRR, 2023

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection.
CoRR, 2023

Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022
An Empirical Study on the Use of Quantum Computing for Financial Portfolio Optimization.
SN Comput. Sci., 2022

Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions.
J. Complex., 2022

A reconfigurable resource management framework for fog environments.
Future Gener. Comput. Syst., 2022

The Hypervolume Indicator: Computational Problems and Algorithms.
ACM Comput. Surv., 2022

Computing representations using hypervolume scalarizations.
Comput. Oper. Res., 2022

Decision space robustness for multi-objective integer linear programming.
Ann. Oper. Res., 2022

2021
Reproducibility in Evolutionary Computation.
ACM Trans. Evol. Learn. Optim., 2021

A model of anytime algorithm performance for bi-objective optimization.
J. Glob. Optim., 2021

Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensions.
CoRR, 2021

Finding multi-objective supported efficient spanning trees.
Comput. Optim. Appl., 2021

Replicability and reproducibility in evolutionary optimization.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

A software library for archiving nondominated points.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem.
Math. Methods Oper. Res., 2020

The Hypervolume Indicator: Problems and Algorithms.
CoRR, 2020

Resilient Service Chains through Smart Replication.
IEEE Access, 2020

A Rank-based Mechanism for Service Placement in the Fog.
Proceedings of the 2020 IFIP Networking Conference, 2020

Energy and Latency-aware Resource Reconfiguration in Fog Environments.
Proceedings of the 19th IEEE International Symposium on Network Computing and Applications, 2020

Algorithm selection of anytime algorithms.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Guiding under uniformity measure in the decision space.
Proceedings of the IEEE Latin American Conference on Computational Intelligence, 2019

Optimization of Service Placement with Fairness.
Proceedings of the 2019 IEEE Symposium on Computers and Communications, 2019

An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms.
Proceedings of the Composability, Comprehensibility and Correctness of Working Software, 2019

2018
Finding representations for an unconstrained bi-objective combinatorial optimization problem.
Optim. Lett., 2018

Implicit enumeration strategies for the hypervolume subset selection problem.
Comput. Oper. Res., 2018

Compressed data structures for bi-objective {0, 1}-knapsack problems.
Comput. Oper. Res., 2018

Dominance, epsilon, and hypervolume local optimal sets in multi-objective optimization, and how to tell the difference.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Bi-dimensional knapsack problems with one soft constraint.
Comput. Oper. Res., 2017

2016
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms.
Evol. Comput., 2016

Greedy Hypervolume Subset Selection in Low Dimensions.
Evol. Comput., 2016

2015
Representation of the non-dominated set in biobjective discrete optimization.
Comput. Oper. Res., 2015

Local Search for Multiobjective Multiple Sequence Alignment.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

Greedy Hypervolume Subset Selection in the Three-Objective Case.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

A proficient high level programming program as a way to overcome unemployment among graduates.
Proceedings of the 2015 IEEE Frontiers in Education Conference, 2015

Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2015

2014
MOSAL: software tools for multiobjective sequence alignment.
Source Code Biol. Medicine, 2014

2013
A note on the ϵ-indicator subset selection.
Theor. Comput. Sci., 2013

On a biobjective search problem in a line: Formulations and algorithms.
Theor. Comput. Sci., 2013

On Local Search for Bi-objective Knapsack Problems.
Evol. Comput., 2013

Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem.
Comput. Optim. Appl., 2013

Improvements on bicriteria pairwise sequence alignment: algorithms and applications.
Bioinform., 2013

2012
Greedy algorithms for a class of knapsack problems with binary weights.
Comput. Oper. Res., 2012

Increasing student commitment in introductory programming learning.
Proceedings of the IEEE Frontiers in Education Conference, 2012

On Beam Search for Multicriteria Combinatorial Optimization Problems.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Dynamic Programming for a Biobjective Search Problem in a Line.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Connectedness and Local Search for Bicriteria Knapsack Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

On the Computation of the Empirical Attainment Function.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2011

2010
On the Performance of Local Search for the Biobjective Traveling Salesman Problem.
Proceedings of the Advances in Multi-Objective Nature Inspired Computing, 2010

On a particular case of the multi-criteria unconstrained optimization problem.
Electron. Notes Discret. Math., 2010

Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization].
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Introduction.
Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization.
Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

2009
On the Complexity of Computing the Hypervolume Indicator.
IEEE Trans. Evol. Comput., 2009

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

Design and analysis of stochastic local search for the multiobjective traveling salesman problem.
Comput. Oper. Res., 2009

2008
Heuristic algorithms for Hadamard matrices with two circulant cores.
Theor. Comput. Sci., 2008

2007
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On local optima in multiobjective combinatorial optimization problems.
Ann. Oper. Res., 2007

Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems.
Proceedings of the Metaheuristics, 2007

2006
Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem.
J. Math. Model. Algorithms, 2006

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands.
J. Math. Model. Algorithms, 2006

A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices.
Eur. J. Oper. Res., 2006

An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005
Exploring the Performance of Stochastic Multiobjective Optimisers with the Second-Order Attainment Function.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2005

2004
Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands.
Proceedings of the Parallel Problem Solving from Nature, 2004

On the Design of ACO for the Biobjective Quadratic Assignment Problem.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study.
Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004

2003
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2003

2002
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

A Racing Algorithm for Configuring Metaheuristics.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

An Experimental Investigation of Iterated Local Search for Coloring Graphs.
Proceedings of the Applications of Evolutionary Computing, 2002


  Loading...