Daniele Catanzaro

Research Projects

This webpage, under construction, lists the current and past research projects carried out so far.

Ongoing research projects (since 2017)

  • Title: Optimizing over unrooted binary tree: Bridging the gap between phylogenetics and coding theory 
    • Funding Source: Université Catholique de Louvain via the “Fonds Speciaux de Recherche 2017” 
    • Period: 2017-2021
    • Role: Principal Investigator
    • Publications generated within this project so far:
  • Title: Coalescens 
    • Funding Source: Fondation Louvain via the call “Le numérique au service de l’humaine”

Past research projects

  • Title: Optimizing over unrooted binary tree 
    • Funding Source: The Belgian National Fund for Scientific Research (FRS-FNRS) via the grant “Crédit de Recherche” ref. S/25-MCF/OL J.0026.17 
    • Period: 2017-2019
    • Role: Principal Investigator
    • Publications and conference talks generated within this project:
      • D. Catanzaro, R. Pesenti, and L. Wolsey. On the Balanced Minimum Evolution Polytope. Discrete Optimization, 36, 1-33, 2020. (Tech Report: TR)
      • D. Catanzaro and R. Pesenti. Enumerating Vertices of the Balanced Minimum Evolution Polytope. Computers and Operations Research, 109, 209-217, 2019. 
      • 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 and R. Pesenti. The Pure Parsimony Estimation Problem. In progress.TR-04-2019, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • D. Catanzaro, M. Frohn, R. Pesenti. Greed, majorization, and their impact on optimization over lattices of unrooted binary trees. In progress. TR-05-2019, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • “On the balanced minimum evolution polytope”. 30th European Conference On Operational Research, Dublin, Ireland, on June 23-26, 2019.
      • The Balanced Minimum Evolution Problem – Part I & Part II: 23st International Symposium on Mathematical Programming (ISMP 2018), Bordeaux, France, on July 1-6, 2018.
      • Some Combinatorial Connections between Phylogenetics and Huffman Coding. International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018), Bologna, Italy, on June 25-27, 2018.