Books  |  Editorial Work  |  Journal Articles  |  Conference Articles  |  Technical Reports  |  Google scholar  |  dblp

 

Books

Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: Methods and Analysis
L.Paquete
Dissertations in Artificial Intelligence, Vol. 295, AKA Verlag/ IOS Press, 2006
(Also PhD thesis, Darmstadt University of Technology, Germany, 2005).

 

Editorial work

Special Issue on Exact and Approximation Methods for Mixed-Integer Multi-Objective Optimization
C. H. Antunes, C.M. Fonseca, L. Paquete, M. Stiglmayr
Mathematical Methods of Operations Research, 100, 1, 2024.

Special Issue on Reproducibility
M. López-Ibáñez, L. Paquete, M. Preuss
Evolutionary Computation Journal, 32, 2024.

Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023
S. Silva, L. Paquete
ACM, 2023.

Evolutionary Computation in Combinatorial Optimization - EvoCOP 2020 - 20th European Conference
L. Paquete, C. Zarges
Lecture Notes in Computer Science 12102, Springer, 2020.

Evolutionary Computation in Combinatorial Optimization - EvoCOP 2019 - 19th European Conference
A. Liefooghe, L. Paquete
Lecture Notes in Computer Science 11452, Springer, 2019.

Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Part I and Part II
A. Auger, C.M. Fonseca, N. Lourenço, P. Machado, L. Paquete, D. Whitley
Lecture Notes in Computer Science 11102, Springer, 2018.

Experimental Methods for the Analysis of Optimization Algorithms
T.Bartz-Beielstein, M.Chiarandini, L.Paquete, M.Preuss
Springer, 2010.
See EJOR review

Proceedings of the Workshop on Experimental Methods for the Assessment of Computational Systems (WEMACS 2010)
T.Bartz-Beielstein, M.Chiarandini , L.Paquete, M.Preuss 
Algorithm Engineering Report TR10-2-007, Technische Universität Dortmund, Germany, 2010

Workshop on Empirical Methods for the Analysis of Algorithms (EMAA 2006)
L. Paquete, M. Chiarandini  
On-line proceedings, 2006.

 

Journal articles

Heuristic approaches to obtain low-discrepancy point sets via subset selection
F. Clément, C. Doerr, L. Paquete
Journal of Complexity, 2024.

An empirical study on the use of quantum computing for financial portfolio optimization 
C. Gomes, G. Falcão, L. Paquete, J.P. Fernandes
SN Computer Science, 3, 335, 2022.

A reconfigurable resource management framework for fog environments
N. Godinho, H. Silva, M. Curado, L. Paquete
Future Generation Computer Systems, 133, 124-140, 2022.

Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
F. Clément, C. Doerr, L. Paquete
Journal of Complexity, 70, 101645, 2022.
Support material is available here.

Computing representations with hypervolume scalarizations
L. Paquete, B. Schulze, M. Stiglmayr, A.C. Lourenço
Computers & Operations Research, 137, 105349, 2022.

Decision space robustness for multi-objective integer linear programming
M. Stiglmayr, J.R. Figueira, K. Klamroth, L. Paquete, B. Schulze
Annals of Operations Research, 319, 1769 - 1791, 2022.

Reproducibility in evolutionary computation 
M. López-Ibáñez, J. Branke, L. Paquete
ACM Transactions in Evolutionary Learning and Optimization, 1(4), 1 - 21, 2021.

Hypervolume indicator: computational problems and algorithms
A.P. Guerreiro. C.M.Fonseca, L. Paquete
ACM Computing Surveys, 54(6), 1 - 42, 2021.

Finding multi-objective supported efficient spanning trees
P. Correia, L. Paquete, J.R. Figueira
Computational Optimization and Applications, 78(2), 491-528, 2021.

Resilient service chains through smart replication
D. Abreu, K. Castro, L. Paquete, M. Curado, E. Monteiro
IEEE Access, 187021 - 187036, 2020.

A model of anytime algorithm performance for bi-objective optimization
A. Jesus, L. Paquete, A. Liefooghe
Journal of Global Optimization, 2020.

On the rectangular knapsack problem - approximation of a specific quadratic knapsack problem
B. Schulze, M. Stiglmayr, L. Paquete, C.M. Fonseca, D. Willems, S. Ruzika
Mathematical Methods of Operations Research, 107-132, 2020.

Implicit enumeration strategies for the hypervolume subset selection problem
R. Gomes, A. Guerreiro, T. Kuhn, L. Paquete
Computers & Operations Research, 100, 244-253, 2018

Finding representations for an unconstrained bi-objective combinatorial optimization problem
A. Jesus, L. Paquete, J.R.Figueira
Optimization Letters, 12, 321-334, 2018.

Compressed data structures for bi-objective {0,1}-knapsack problems
P.Correia, L.Paquete, J.R.Figueira
Computers & Operations Research, 89, 82-93, 2018. Errata

Easy to say they're hard, but hard to see they're easy - Toward a categorization of tractable multiobjective combinatorial optimization problems
J.R.Figueira, C.M.Fonseca, P.Halffmann, K.Klamroth, L.Paquete, S.Ruzika, B.Schulze, M.Stiglmayr, D.Willems
Journal of Multi-Criteria Decision Analysis, 24 (1-2), 82-98, 2017

Bi-dimensional knapsack problems with one soft constraint
B.Schulze, L.Paquete, K.Klamroth, J.R.Figueira
Computers & Operations Research, 78, 15-26, 2017.

Greedy hypervolume subset selection in low dimensions
A.Guerreiro, C.M.Fonseca, L.Paquete
Evolutionary Computation, 24(3), 521-544, 2016.
Support material is available here.

Hypervolume subset selection in two dimensions: formulations and algorithms
T.Kuhn, C.M.Fonseca, L.Paquete, S.Ruzika, M.Duarte, J.R.Figueira
Evolutionary Computation, 24(3), 411-425, 2016.
Support material is available here.

Heuristics for multiobjective multiple sequence alignment
M.Abbasi, L.Paquete, F.Pereira
BioMedical Engineering Online, 15(70), 2016.

Representation of the non-dominated set in biobjective discrete optimization
D.Vaz, L.Paquete, C.M.Fonseca, K. Klamroth, M.Stiglmayr
Computers & Operations Research, 63, 172-186, 2015.

Multi-objective dynamic programming for spatial cluster detection
G.J.P.Moreira, L.Paquete, L.Duczmal, D.Menotti, R.Takahashi
Environmental and Ecological Statistics, 22(2), 369-391, 2015.

MOSAL: Software tools for multiobjective sequence alignment
L.Paquete, P.Matias, M.Abbasi, M.Pinheiro
Source Code for Biology and Medicine, 9(2), 2014.

On a biobjective search problem in a line: formulations and algorithms
L.Paquete, M.Jaschob, K.Klamroth, J.Gorski
Theoretical Computer Science, 507: 61-71, 2013.

A note on the ε-indicator subset selection
D.Vaz, L.Paquete, A.Ponte
Theoretical Computer Science, 499: 113-116, 2013.

Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
J.R.Figueira, L.Paquete, M.Simões, D.Vanderpooten
Computational Optimization and Applications, 56(1):97-111, 2013.

Improvements on bicriteria pairwise sequence alignment: algorithms and applications
M.Abbasi, L.Paquete, A.Liefooghe, M.Pinheiro, P.Matias
Bioinformatics, 29(8):996-1003, 2013. 
Support material is available here.

On local search for bi-objective knapsack problems
A.Liefooghe, L.Paquete, J.R.Figueira
Evolutionary Computation, 21(1):179-196, 2013.

Greedy algorithms for a class of knapsack problems with binary weights
J.Gorski, L.Paquete, F.Pedrosa
Computers & Operations Research, 39(3):498-511, 2012.
Support material is available here.

On the complexity of computing the hypervolume indicator 
N.Beume, C.M.Fonseca, M.López-Ibáñez, L.Paquete, J.Vahrenhold
IEEE Transactions on Evolutionary Computation, 13(5):1075-1082, 2009.

E.D. Demaine and J. O'Rourke, review of geometric folding algorithms: Linkages, origami, polyhedra, Cambridge University Press (2007)
L.Paquete
European Journal of Operational Research, 199(1):311-313, 2009. (Book review)

Design and analysis of stochastic local search for the multiobjective traveling salesman problem
L.Paquete, T.Stützle
Computers & Operations Research, 36(9):2619-2631, 2009.

Heuristic algorithms for Hadamard matrices with two circulant cores
M.Chiarandini, I.Kotsireas, C.Koukouvinos, L.Paquete
Theoretical Computer Science, 407(1-3):274-277, 2008.
Support material is available here.

On local optima in multiobjective combinatorial optimization problems 
L.Paquete, T.Schiavinotto, T.Stützle
Annals of Operations Research, 156(1):83-97, 2007.

A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices 
L.Paquete, T.Stützle
European Journal of Operational Research, 169(3):943-959,2006.

Hybrid metaheuristics for the vehicle routing problem with stochastic demands 
L.Bianchi, M.Birattari, M.Chiarandini, M.Manfrin, M.Mastrolilli, L.Paquete, O.Rossi-Doria, T.Schiavinotto
Journal of Mathematical Modelling and Algorithms, 5(1):91-110, 2006.

Hybrid population-based algorithms for the bi-objective quadratic assignment problem 
M.López-Ibáñez, L.Paquete, T.Stützle
Journal of Mathematical Modelling and Algorithms, 5(1):111-137, 2006.

 

Books chapters

Spatial cluster detection through a dynamic programming approach
G.J.P. Moreira, L. Paquete, L.H. Duczmal, D. Menotti and R.H.C. Takahashi
Hanbook of Scan Statistics, 1-13, Springer, 2017.

Exploratory analysis of stochastic local search algorithms in biobjective optimization
M.López-Ibáñez, L.Paquete, T.Stützle 
Experimental Methods for the Analysis of Optimization Algorithms, 209-222, Springer, 2010.

Introduction
M.Chiarandini, T.Bartz-Beielstein, L.Paquete, M.Preuss
Experimental Methods for the Analysis of Optimization Algorithms, 1-12, Springer, 2010.

On the performance of local search for the biobjective traveling salesman problem
L.Paquete, T.Stützle
Advances in Multi-objective Nature Inspired Computing, Studies in Computational Intelligence Series, 143-165, Springer, 2010.

Stochastic local search algorithms for multiobjective combinatorial optimization: A review
L.Paquete, T.Stützle
Handbook of Approximation Algorithms and Metaheuristics, Computer and Information Science Series. Chapman & Hall / CRC, 2007

 

Conference articles

An empirical study on the energy efficiency of matrix transposition algorithms
G. Lopes, J. P. Fernandes, L. Paquete
Composability, Comprehensibility and Correctness of Working Software. CEFP 2019, 2023.

Computing star discrepancies with numerical black-box optimization algorithms
F. Clément, D. Vermetten, J. De Nobel, A. Jesus, L. Paquete, C. Doerr
GECCO 2023, 1330-1338, 2023.

On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization
A. Jesus, L. Paquete, A. Liefooghe, B. Derbel 
GECCO 2021, 234-242, 2021.

Energy and latency-aware resource configuration in fog environments 
N. Godinho, H. Silva, M. Curado, L. Paquete 
IEEE NCA 2020, 2020.

A rank-based mechanism for service placement in the fog 
K. Velasquez, D.P. Abreu, L. Paquete, M. Curado, E. Monteiro 
IFIP Networking 2020, 64-72, 2020.

Algorithm selection of anytime algorithms
A. Jesus, A. Liefooghe, B. Derbel, L. Paquete 
GECCO 2020, 850–858, 2020.

Optimization of service placement with fairness
N. Godinho, M. Curado, L. Paquete 
IEEE Symposium on Computers and Communications (IEEE ISCC 2019), 1-6, 2020.

Guiding under uniformity measure in the decision space
G. Moreira, L. Paquete 
IEEE Latin American Conference on Computational Intelligence (IEEE LA-CCI 2019), 1-6, 2019.

A combinatorial branch and bound for the min-max regret spanning tree problem
N. Godinho, L. Paquete
International Symposium on Experimental Algorithms (SEA^2 2019), LNCS 11544, 69-81, Springer, 2019.

Dominance, epsilon, and hypervolume local optimal sets, and how to tell the difference
A. Liefooghe, M. López-Ibáñez, L. Paquete, S. Verel
Genetic and Evolutionary Computation Conference (GECCO 2018), ACM Press, 324-331, 2018.

A proficient high level programming program as a way to overcome unemployment among graduates 
M.J.Marcelino, B.Cabral, A.L.Mendes, L.Paquete
2015 Frontiers in Education Conference (FIE 2015), 2015

Greedy hypervolume subset selection in the three-objective case 
A.Guerreiro, C.M.Fonseca, L.Paquete
Genetic and Evolutionary Computation Conference (GECCO 2015), ACM Press, 671-678, 2015.
Best paper award.

Experiments on local search for bi-objective unconstrained binary quadratic programming. 
A.Liefooghe, S.Verel, L.Paquete, J.-K. Hao
8th Conference on Evolutionary Multi-criterion Optimization (EMO 2015), LNCS 9081, 48-59, Springer, 2015.

Local search for multiobjective multiple sequence alignment. 
M.Abbasi, L.Paquete, F.Pereira
3th Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO 2015), LNCS 9044, 175-182, Springer, 2015.

Increasing student commitment in introductory programming learning. 
A.L.Mendes, A.Gomes, L.Paquete, A.Cardoso
2012 Frontiers in Education Conference (FIE 2012), 82-87, 2012.
Novas Fronteiras da Engenharia award.

Dynamic programming for a biobjective search problem in a line.
L.Paquete, M.Jaschob, K.Klamroth, J.Gorski
6th International Conference on Combinatorial Optimization and Applications (COCOA 2012), LNCS 7402, 348-359, Springer, 2012.

On beam search for multicriteria combinatorial optimization problems. 
A.Ponte, L.Paquete, J.R.Figueira
9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2012), LNCS 7298, 307-321, Springer, 2012. (Movie)

Connectedness and local search for bicriteria knapsack problems. 
A.Liefooghe, L.Paquete, M.Simões, J.R.Figueira
11th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2011), LNCS 6622, 48-59, Springer, 2011.
Best paper award.

On the computation of the empirical attainment function.
C.M.Fonseca, A.P.Guerreiro, M.López-Ibáñez, L.Paquete
6th International Conference on Evolutionary Multi-criterion Optimization (EMO 2011), LNCS 6576, 106-190, Springer, 2011.

On a particular case of the multi-criteria unconstrained optimization problem
J.Gorski, L.Paquete
International Symposium in Combinatorial Optimization (ISCO 2010), Electronic Notes on Discrete Mathematics, 36, 135-142, 2010 (extended version).

Graphic tools for the analysis of bi-objective optimization algorithms
M.López-Ibáñez, T.Stützle, L.Paquete
Genetic and Evolutionary Computation Conference (GECCO 2010), ACM Press, 1959-1962, 2010.

Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis
L.Paquete, T.Stützle
7th Conference on Multiobjective Programming and Goal Programming (MOPGP 2006), Multiobjective Programming and Goal Programming: Theoretical Results and Practical Applications, LNEMS 618, 69-78, Springer, 2009 (extended version).

Using experimental design to analyze stochastic local search algorithms for multiobjective problems
L.Paquete, T.Stützle, M.López-Ibáñez
6th Metaheuristics International Conference (MIC 2005), Metaheuristics - Progress in Complex Systems Optimization, Vol. 39 of Operations Research / Computer Science Interfaces Book Series, 325-344, Springer, 2007 (extended version).

An improved dimension-sweep algorithm for the hypervolume indicator
C.M. Fonseca, L.Paquete, M.López-Ibáñez
IEEE Congress on Evolutionary Computation (CEC 2006), 1157-1163, 2006.

Exploring the performance of stochastic multiobjective optimisers with the second-order attainment function.
C.M.Fonseca, V.Grunert daFonseca, L.Paquete
3rd International Conference on Evolutionary Multi-criterion Optimization (EMO 2005), LNCS 3410, 250-264, Springer, 2005.

Metaheuristics for the vehicle routing problem with stochastic demand
L.Bianchi, M.Birattari, M.Chiarandini, M.Manfrin, M.Mastrolilli, L.Paquete, O.Rossi-Doria, T.Schiavinotto
8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), LNCS 3242, 450-460, Springer, 2004.

On the design of ACO for the biobjective quadratic assignment problem.
M.López-Ibáñez, LPaquete, T.Stützle
4th International Workshop on Ant Colony Optimization (ANTS 2004), LNCS 3172, 214-225, Springer, 2004.

Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study
L.Paquete, M.Chiarandini, T.Stützle
Multiobjective Metaheuristics Workshop (MOMH 2002), Metaheuristics for Multiobjective Optimisation, LNEMS 535, Springer, 2004 (extended version).

A two-phase local search for the biobjective traveling salesman problem
L.Paquete, T.Stützle
2nd International Conference on Evolutionary Multi-criterion Optimization (EMO 2003), LNCS 2632, 479-493, Springer, 2003.

A comparison of the performance of different metaheuristics on the timetabling problem
O.Rossi-Doria, M.Samples, M.Birattari, M.Chiarandini, M.Dorigo, L.Gambardella, J.Knowles, M.Manfrin, M.Mastrolilli, B.Paechter, L.Paquete, T.Stützle
4th Conference on Practice and Theory of Automated Timetabling (PATAT 2002), Selected Papers, LNCS 2740, 329-351, Springer, 2003 (extended version).

Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem
L.Paquete, T.Stützle
4th Conference on Practice and Theory of Automated Timetabling (PATAT 2002), 413-420, 2002.

A racing algorithm for configuring metaheuristics
M.Birattari, T.Stützle, L.Paquete, K.Varrentrapp
Genetic and Evolutionary Computation Conference (GECCO 2002), Morgan Kaufmann Publishers, 11-18, 2002.
ACM SIGEVO GECCO Impact Award, GECCO 2012

Experimental investigation of iterated local search for coloring graphs 
L.Paquete, T.Stützle
Applications of Evolutionary Computing, EvoWorkshops 2002, LNCS 2279, 122-131, Springer, 2002. 
Best paper award.

A study of examination timetabling with multiobjective evolutionary algorithms
L.Paquete, C.M. Fonseca
4th Metaheuristics International Conference (MIC 2001), 149-154, 2001.

 

Tutorials

Replicability and reproducibility in evolutionary optimization
L. Paquete, M. López-Ibáñez 
GECCO Companion 2021: 454-462, 2021.

 

(Extended) Abstracts 

Computing representations for combinatorial optimization problems based on the hypervolume indicator
B. Schulze, L. Paquete, M. Stiglmayr
26th International Conference on Multiple Criteria Decision Making (MCDM 2022): 79, 2022.

Efficient algorithms for star discrepancy subset selection
F. Clément, C. Doerr, L. Paquete 
15th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2022): 100, 2022.

A software library for archiving nondominated points
D.M. Dias, A.D. Jesus, L. Paquete 
GECCO Companion 2021: 53-54, 2021.

Robustness indicators for multi-objective integer linear programming 
M. Stiglmayr, J.R. Figueira, K. Klamroth, L. Paquete, B. Schulze
25th International Conference on Multiple Criteria Decision Making (MCDM 2019), 2019.

A model of anytime algorithm performance for biobjective optimization problems 
A.D. Jesus, L. Paquete, A. Liefooghe
International Workshop on Global Optimization (LeGO 2018), 2018.

Quadratic scalarization for bi-objective optimization problems and the rectangular knapsack problem
B. Schulze, C.M. Fonseca, L.Paquete, S. Ruzika, M. Stiglmayr, D. Willems
International Conference on Optimization (SIGOPT 2018), 2018.

Finding representations for an unconstrained bi-objective combinatorial optimization problem
A.D. Jesus, L.Paquete, J.R. Figueira
International Conference on Optimization (SIGOPT 2018), 2018.

Hypervolume maximizing representation for the biobjective knapsack problem: the rectangular knapsack problem
B. Schulze, C.M. Fonseca, L.Paquete, S. Ruzika, M. Stiglmayr, D. Willems
International Conference on Operations Research (OR 2017), 2017.

The rectangular knapsack problem: Hypervolume maximizing representation
B. Schulze, C.M. Fonseca, L.Paquete, S. Ruzika, M. Stiglmayr, D. Willems
24th International Conference on Multiple Criteria Decision Making (MCDM 2017), 2017.

Compressed data structures for the biobjective {0,1}-knapsack problem
P. Correia, J.R.Figueira, L.Paquete
27th European Conference on Operational Research (EURO 2015), 2015.

Techniques for solution set compression in multiobjective optimization
J.R.Figueira, P. Correia, L.Paquete
23rd International Conference on Multiple Criteria Decision Making (MCDM 2015), 2015.

Dry climate as a predictor of Chagas' disease irregular clusters: A covariate study
L.H.Duczmal, G.J.Moreira, L.Paquete, D. Menotti, R.C.Takahashi, D. Burgarelli
13th Conference of the International Society for Disease Surveillance (ISDS 2014), Online Journal of Public Health Informatics, 7:1, 2015.

Transforming constraints into objectives: biobjective solution method for solving bidimensional knapsack problems 
B.Schulze, L.Paquete, K.Klamroth, J.R.Figueira
International Conference on Operations Research (OR2014), 2014.

Finding representative subsets in multiobjective discrete optimization
L.Paquete, A.Ponte, M.Stiglmayr, D.Vaz
22nd International Conference on Multiple Criteria Decision Making (MCDM 2013), 2013.

Transforming constraints into objectives: experiments with bidimensional knapsack problems
B.Schulze, K.Klamroth, L.Paquete
22nd International Conference on Multiple Criteria Decision Making (MCDM 2013), 2013.

Algorithms and applications of biobjective pairwise sequence alignment
L.Paquete, M.Abbasi, M.Pinheiro, P.Matias
The 2012 Mini EURO Conference on Computational Biology, Bioinformatics and Medicine (EURO-CBBM 2012), 2012.

Algorithms for multiobjective sequence alignment
L.Paquete, M.Abbasi, M.Pinheiro, P.Matias
2nd Workshop on Bio-Optimization, 2012.

Concise representation of nondominated sets in discrete multicriteria optimization
L.Paquete, C.M.Fonseca, K.Klamroth, M.Stiglmayr
21st International Symposium on Mathematical Programming (ISMP 2012), 2012.

Spatial cluster detection through constrained dynamic programming
G.J.Moreira, L.H.Duczmal, L.Paquete, R.C.Takahashi
10th Conference of the International Society for Disease Surveillance (ISDS 2011), Emerging Health Threats Journal, 4:47, 2011.

Efficient paths by local search
L.Paquete, J.L.Santos, D.Vaz
7th ALIO/EURO Workshop on Applied Combinatorial Optimization, 2011.

Local search for the bi-objective unconstrained optimization problem
A.Liefooghe, L.Paquete, M.Simões, J.R.Figueira
3rd International Conference on Metaheuristics and Nature Inspired Computing (META 2010), 2010.

Finding mines in a Line
J.Gorski, M.Jaschob, K.Klamroth, L.Paquete
16th European Conference on Mathematics for Industry (ECMI 2010), 78, 2010.

A polynomial time algorithm for a cardinality constrained multicriteria knapsack problem
F.Seipp, L.Paquete, S.Ruzika
24th European Conference on Operational Research (EURO XXIV), 11, 2010.

Three algorithms for finding mines in a line
L. Paquete, M. Jaschob, J. Gorski, K. Klamroth
24th European Conference on Operational Research (EURO XXIV), 11, 2010.

On the clustering of the efficient set for the multicriteria 0/1 knapsack problem
L.Paquete, C.Camacho, J.R.Figueira
22nd European Conference on Operational Research (EURO XXII), 212, 2007.

Finding mines in a line: A biobjective formulation
L.Paquete, M.Pranzo, M.Sodhi, T.Stützle
21st European Conference on Operational Research (EURO XXI), 58, 2006.

 

Posters

Algorithms and data structures for large scale geographic information systems: a performance evaluation 
B.Simões, L.Paquete, C.Caçador, R.Reino
18th International Conference on Geographic Information Science (AGILE 2015), 2015.

Visualisation and analysis of geographic information: algorithms and data structures 
J.Valença, L.Paquete, C.Caçador, R.Reino
18th International Conference on Geographic Information Science (AGILE 2015), 2015.

Local search for bicriteria multiple sequence alignment 
M.Abbasi, L.Paquete, F.Pereira, S.Schenker
German Conference on Bioinformatics, 102, 2013.

Dynamic programming algorithms for biobjective sequence alignment 
M.Abbasi, L.Paquete, M.Pinheiro
Bioinformatics Open Days, 40, 2012.

Multiobjective sequence alignment: Formulation and algorithms
M.Abbasi, L.Paquete, A.Liefooghe, M.C.Dias
19th International Conference on Intelligent Systems for Molecular Biology and 10th European Conference on Computational Biology (ISMB/ECCB 2011), 2011.

 

Technical reports

Computing R2-Optimal Representations of the Pareto Front on a Budget 
K. Klamroth, F. Bökler, S. R. Hunter, A. Jaszkiewicz, A. Liefooghe, L. Paquete, S. Sayin, B. Schulze, D. Vanderpooten.
Multiobjective Optimization on a Budget, Report Dagstuhl Seminar 23361, 2022 

Turning objectives into constraints? Or vice versa?
G.Fadel, K.-H. Küfer, M. López-Ibáñez, L. Paquete, S. Ruzika, A. Schobel.
Scalability in Multiobjective Optimization, Report Dagstuhl Seminar 20031, 2020

Personalization of multicriteria decision support systems
M.Ehrgott, G. Eichfelder, K.-H. Küfer, C. Lofi, K. Miettinen, L.Paquete, S. Ruzika, S. Sayin, R. E. Steuer, T.J. Stewart, M.Stiglmayr, D.Vanderpooten
Personalized Multiobjective Optimization: An Analytics Perspective, Report Dagstuhl Seminar 18031, 2018

Educating the community
U.A.Acar, J.N.Amaral, D.A.Bader, J.Bishop, R.F.Boivert, M. Chiarandini, M. Chimani, D. Delling, C. Demetrescu, A. Diwanm D. Duplyakin, E. Eide, E. Ernst, S.Fishmeister, N. Fuhr, P.G.Giarruso, A.V.Goldberg, M.Hagen, M. Hauswirth, B. Hiller, R. Jones, T. Kalibera, M. Lübbecke, C.C.McGeoch, K. Mehlhorn, J.E.B.Moss, I. Munro, P. Mutzel, L. Paquete, M. Resende, P. Sanders, N. Sitchinava, P.F. Sweeney, W.F.Tichy, P. Tuma, D. Wagner, R. Wattenhofer 
Rethinking Experimental Methods in Computing, Report Dagstuhl Seminar 16111, 2016

Computational complexity
D.Brockhoff, M.Ehrgott, J.R.Figueira, L.Martí, L.Paquete, M.Stiglmayr, D.Vanderpooten
Understanding Complexity in Multiobjective Optimization, Report Dagstuhl Seminar 15031, 2015

BiMuSA: An implementation for biobjective multiple sequence alignment problems
S.Schenker, L.Paquete
CISUC Technical Report TR2013/03, University of Coimbra, 2013.
Support material is available here.

On a cardinality constrained multicriteria knapsack problem
F.Seipp, S.Ruzika, L.Paquete
Report in Wirtschaftsmathematik Nr. 133/2011, University of Kaiserslautern, 2011

Experiments on metaheuristics: Methodological overview and open issues
M.Chiarandini, L.Paquete, M.Preuss, E.Ridge
DMF-2007-03-003, The Danish Mathematical Society, 2007

An algorithm for the car sequencing problem of the ROADEF 2005 challenge
M.Risler, M.Chiarandini, L.Paquete, T.Schiavinotto, T.Stützle
Technical Report AIDA-04-06, Darmstadt University of Technology, 2004.

Classification of metaheuristics and design of experiments for the analysis of components
M.Birattari, L.Paquete, T.Stützle, K.Varrentrapp
Technical Report AIDA-01-05, Darmstadt University of Technology, 2001.

Others

Overview of GECCO 2023
S. Silva, L. Paquete
ACM SIGEVOlution 16 (4), 1-4, 2023