This page lists the current doctoral students under my supervision as well as some doctoral students and postdocs with who I have/had strong interactions during their research activities.
News: Doctoral research funds & a postdoctoral position in Discrete Optimization are currently available at CORE. If you are interested, contact me.
Current Doctoral Students and Postdocs
Allan Sapucaia
Doctor in Combinatorial Optimization from the University of Campinas (2017-2022) under the supervision of both Pedro J. de Rezende and Cid C. de Souza. His doctoral studies focused on computational geometry and integer linear programming, with special attention to the development of decomposition techniques for partitioning, packing and covering problems. Allan got both the von Neumann Award (Highest GPA among C.E graduates – Institute of Computing, UNICAMP 2017) and the Babbage Award (Highest GPA among C.E students – Institute of Computing, UNICAMP 2015). He is currently focusing on optimization problems defined over specific classes of acyclic connected graphs.
Henri Dehaybe
Henri graduated in Management Engineering at the Université Catholique de Louvain (2017). Henri’s doctoral studies are currently co-supervised by my colleague, Philippe Chevalier and myself. So far, we coauthored the following articles:
- H. Dehaybe, D. Catanzaro, and P. Chevalier. A deep reinforcement learning approach for the stochastic inventory problem. Submitted to Operations Research, 2021.
Roberto Ronco
Roberto is carrying out his doctoral studies in Computer Science and Operations Research at the University of Genoa, Italy, under the supervision of Massimo Paolucci. Large part of his research efforts are currently focusing on scheduling problems. I have collaborated with Roberto in the context of the following article:
- D. Catanzaro, R. Pesenti, R. Ronco. A new fast and accurate solution approach for the automatic scene detection problem. To appear in Computers and Operations Research, 2021.
- D. Catanzaro, R. Pesenti, R. Ronco. On Energy-efficient Scheduling with Time-of-Use Costs. Working paper, 2021.
Roberto will be visiting CORE between September and October 2021, and will defend his doctoral thesis in February 2022.
Former Doctoral Students
Martin Frohn
Martin graduated in economathematics at the University of Cologne (2017). At present, I am supervising his doctoral studies, which focus on specific combinatorial and optimization aspects of computational phylogenetics. So far, Martin authored the following manuscripts:
- D. Catanzaro, M. Frohn, O. Gascuel, and R. Pesenti. A Tutorial on the Balanced Minimum Evolution. To appear in the European Journal of Operational Research, invited article, 2021.
- M. Frohn. On the approximability of the Fixed-Tree Balanced Minimum Evolution Problem. To appear in Optimization Letters, 2021.
- D. Catanzaro, M. Frohn, and R. Pesenti. An information theory perspective on the Balanced Minimum Evolution Problem. Operations Research Letters, 48(3): 362-367, 2020.
Martin defended his doctoral thesis on October 27 2021.
Collaborations with Former Doctoral Students and Postdocs
Céline Engelbeen
Céline completed her doctoral studies at Department of Mathematics of the Université Libre de Bruxelles in 2010, under the supervision of my colleague Samuel Fiorini. She worked on constrained decompositions of integer matrices in the context of intensity modulated radiation therapy. We collaborated during her postdoctoral studies on the following article:
- D. Catanzaro and C. Engelbeen. An integer linear programming formulation for the minimum cardinality segmentation problem. Algorithms, 8(4), 999-1020, 2015.
Celine is currently tenured lecturer at ICHEC.
Luciano Porretta
Luciano graduated in Computer Science at the University of l’Aquila, Italy, under my co-supervision (2010). He carried out his doctoral studies at the Graphs and Mathematical Optimization Unit of the Computer Science Department of the Université Libre de Bruxelles, Belgium, under the supervision of my colleague Bernard Fortz. He was awarded the title of Doctor of Sciences in January 2018. I have intensely collaborated with Luciano on a large part of his doctoral studies, focused on models and methods in genome-wide association studies. Our collaboration gave rise to the following articles:
- L. Porretta, D. Catanzaro, B. V. Halldórsson, and B. Fortz. A Branch&Price Algorithm for the Minimum Cost Clique Cover Problem in Max-Point Tolerance Graphs. 4OR, 17(1), 75-96, 2019.
- D. Catanzaro, M. Labbé, and L. Porretta. A class representative model for pure parsimony haplotyping under uncertain data. PLoS One 6(3): e17937, 2011.
Luciano is currently research scientist at OM Partners.
Participation to Doctoral Defense Committees
I have been member of the following doctoral defense committees:
- Xavier Gillard. Discrete Optimization with Decision Diagrams. Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Louvain School of Engineering, Universit`e Catholique de Louvain, August 2022. Member of the Committee.
- Julien Dewez. Lower Bounds on the Nonnegative Rank Computational Approaches. Institute for Information and Communication Technologies, Electronics and Applied Mathematics, Université Catholique de Louvain, November 2021. Member of the Committee and Secretary.
- Martin Frohn. Models and Methods for Computational Phylogenetics based on Minimum Evolution. Center for Operations Research and Econometrics, Université Catholique de Louvain, September 2021. Supervisor.
- Nikita Doikov. Development of Second-Order Methods for Convex Optimization Problems. Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Louvain School of Engineering, Universitè Catholique de Louvain, June 2021. Member of the Committee and Secretary.
- Josè Miguel Pesada Perez. Express shipment service network design: Challenges, advances and robustness. Louvain School of Management, Universitè Catholique de Louvain. June 17, 2020. Chairman.
- Luciano Porretta. Models and methods for genome-wide association studies. Graphs and Mathematical Optimization Unit, Computer Science Department, Universitè Libre de Bruxelles, January 2018. Member of the Committee.
- Cyrille Dejemeppe. Abstractions and algorithms for scheduling applications. Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Louvain School of Engineering, Universitè Catholique de Louvain, June 2016. Member of the Committee.
- Veronica Dal Sasso. Branch-and-price approaches for pure-parsimony haplotyping. Department of Mathematics, University of Padua, Italy, December 2016. Member of the Committee.