One postdoctoral position in Discrete Optimization is currently available at the Center for Operations Research and Econometrics (CORE) within the project “Optimizing over unrooted binary trees”. If you’re interested, please contact me.
Daniele Catanzaro
Professor of Discrete Optimization •
Center for Operations Research & Econometrics • Université Catholique de Louvain
Short Bio
I am Professor of Discrete Optimization, currently serving as Head of the Center for Operations Research and Econometrics (CORE) of the Université Catholique de Louvain.
I graduated summa cum laude in Automation & Computer Science Engineering at the Universitá degli Studi di Palermo, Italy (2003), and I was awarded the Ph.D. in Computer Science by the Université Libre de Bruxelles (2008), for my studies in discrete optimization, network design and computational phylogenetics. Prior to joining the Université Catholique de Louvain in 2014, I was appointed Chargé de Recherches at the Belgian National Fund for Scientific Research (2009-2013) and Assistant Professor of Discrete Optimization at the Faculty of Economics and Business of the Rijksuniversiteit Groningen (2013-2014).
I serve as an Associate Editor for Soft Computing since 2021. I am panel member for the Canadian NSERC/CRSNG (calls 2022-2025), and appointed Expert for the European Research Executive Agency for the REA Marie Skłodowska-Curie European Postdoctoral Fellowships calls 2022 and 2023.
Research Activities
I am a computer scientist and an applied mathematician.
My research interests focus on discrete optimization, search algorithms, massive parallelism, and high performance computing. Specific optimization problems I worked on include: linear, nonlinear and uncertain network design problems, (versions of) the Steiner tree problem, colouring, covering, and partitioning problems, routing problems, (generalised versions of) the traveling salesman and the quadratic assignment problems, and nonlinear inverse problems. I am also particularly interested in specific topics from the area of data compression & encryption as well as from bioinformatics, including the development of predictive models for tumorigenesis, genome-wide association studies, and in the combinatorics and computational aspects of molecular evolution and phylogenetics, with special focus on distance methods and balanced minimum evolution.
My research activities have been supported by the Belgian National Fund for Scientific Research, the Louvain Foundation, the U.S. National Institutes of Health, the Belgian American Educational Foundation (BAEF), and the European Marie Curie Fellowship Program.
Mathematical Genealogy
Selected & Recent Publications
- D. Catanzaro, M. Frohn, O. Gascuel, and R. Pesenti. A Massively Parallel Branch-&-Bound Algorithm for the Balanced Minimum Evolution Problem. Computers & Operations Research, 158, 106308, 2023.
- D. Catanzaro, M. Frohn, O. Gascuel, and R. Pesenti. A Tutorial on the Balanced Minimum Evolution. European Journal of Operational Research, 300(1): 1-19, 2022. Invited article.
- D. Catanzaro, R. Pesenti, and L. Wolsey. On the Balanced Minimum Evolution Polytope. Discrete Optimization, 36: 100570, 2020.
- 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.
- D. Catanzaro, S. E. Shackney, A. A. Schäffer, and R. Schwartz. Classifying the progression of Ductal Carcinoma from single-cell sampled data via integer linear programming: A case study. IEEE/ACM Transactions in Computational Biology and Bioinformatics, 13(4):643–655, 2016.
- D. Catanzaro, M. Labbé, R. Pesenti, and J. J. Salazar-González. The balanced minimum evolution problem. INFORMS Journal on Computing, 24(2), 276-294, 2012.