Alexandre D. Jesus

About

I am currently a PhD candidate at the Universities of Coimbra and Lille under a co-tutelle program advised by Luís Paquete, Arnaud Liefooghe and Bilel Derbel. I am also working as an Invited Assistant at the University of Coimbra and part of the ALGO Lab research laboratory. Furthermore, I enjoy organizing, participating, and advising for programming competitions and hackathons (let me know if you are a student and want to get into competitive programming). Previously, I worked as a developer at Whitesmith.

Research Interests

Multi-objective Optimization
Combinatorial Optimization
Algorithm Portfolios
Algorithm Selection
Anytime Algorithms

Education

M.Sc. in Informatics Engineering, University of Coimbra (2015)
B.Sc. in Informatics Engineering, University of Coimbra (2013)

Publications

A. D. Jesus, L. Paquete, B. Derbel, A. Liefooghe. On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization. Proceedings of the 2021 Genetic and Evolutionary Computation Conference (GECCO 2021), 234-242, 2021. DOI :: PDF
D. M. Dias, A. D. Jesus, L. Paquete. A software library for archiving nondominated points. Proceedings of the 2021 Genetic and Evolutionary Computation Conference Companion (GECCO 2021), 53-54, 2021. DOI :: PDF
A. D. Jesus, L. Paquete, A. Liefooghe, B. Derbel. Techniques to analyze the anytime behavior of algorithms for multi-objective optimization. 31st European Conference on Operational Research (EURO 2021). PDF
A. D. Jesus, A. Liefooghe, B. Derbel, L. Paquete. Algorithm Selection of Anytime Algorithms. Proceedings of the 2020 Genetic and Evolutionary Computation Conference (GECCO 2020), 850-858, 2020. DOI :: PDF
A. D. Jesus, L. Paquete, A. Liefooghe. A model of anytime algorithm performance for bi-objective optimization. Journal of Global Optimization 79, 329–350, 2021. DOI :: PDF
A. D. Jesus, L. Paquete, A. Liefooghe. A model of anytime algorithm performance for biobjective optimization problems. AIP Conference Proceedings 2070(1), 020049, 2019. DOI :: PDF
A. D. Jesus, L. Paquete, J. R. Figueira. Finding representations for an unconstrained bi-objective combinatorial optimization problem. Optimization Letters 12, 321-334, 2018. DOI :: PDF
A. D. Jesus. Implicit Enumeration for Representation Systems in Multi-objective Optimization. Masters Thesis, University of Coimbra, 2015. Handle :: PDF

Software

anytime: An R library to study the anytime behavior of algorithms. It provides several publication ready ggplot2 plots, and a scalar measure of anytime behavior. Code
nondLib: A C++ library for building and updatings sets of nondominated points. It provides several methods to filter the nondominated points from a larger set, and a method to add nondominated points to a set. Code :: Zenodo
moco_abm: A binary and library in Rust to compute the ideal anytime behavior theoretical model for anytime algorithms to bi-objective optimization problems that collect an efficient solution at each iteration. Code :: Zenodo

Teaching

University of Coimbra — Invited Assistant

Algorithmic Strategies (previously Advanced Programming Laboratory)
- 2020-2021
- 2017-2018
Data Structures and Algorithms
- 2020-2021
Experimental Methods in Computer Science
- 2020-2021
Introduction to Procedural Programming
- 2020-2021
Compilers
- 2016-2017
Introduction to Programming in Java
- 2013-2014