A non-linear optimization procedure to estimate distances and instantaneous substitution rate matrices under the GTR model. - Daniele Catanzaro; Raffaele Pesenti; Michel C. Milinkovitch (Bioinform., 2006)

An Exact Approach for solving the Balanced Minimum Evolution Problem. - Roberto Aringhieri; Chiara Braghin; Daniele Catanzaro (CTW, 2008)

The pure parsimony haplotyping problem: overview and computational advances. - Daniele Catanzaro; Martine Labbé (Int. Trans. Oper. Res., 2009)

The minimum evolution problem: Overview and classification. - Daniele Catanzaro (Networks, 2009)

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (Networks, 2009)

A Class Representative Model for Pure Parsimony Haplotyping. - Daniele Catanzaro; Alessandra Godi; Martine Labbé (INFORMS J. Comput., 2010)

Estimating Phylogenies from Molecular Data. - Daniele Catanzaro (Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 2011)

Optimal solutions for the balanced minimum evolution problem. - Roberto Aringhieri; Daniele Catanzaro; Marco Di Summa (Comput. Oper. Res., 2011)

A branch-and-cut algorithm for the partitioning-hub location-routing problem. - Daniele Catanzaro; Éric Gourdin; Martine Labbé; F. Aykut Özsoy (Comput. Oper. Res., 2011)

Reduction approaches for robust shortest path problems. - Daniele Catanzaro; Martine Labbé; Martha Salazar-Neumann (Comput. Oper. Res., 2011)

A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. - Daniele Catanzaro; Martine Labbé; Bjarni V. Halldórsson (ISBRA, 2012)

The Balanced Minimum Evolution Problem. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (INFORMS J. Comput., 2012)

A mixed integer linear programming model to reconstruct phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion. - Daniele Catanzaro; Ramamoorthi Ravi; Russell Schwartz (Algorithms Mol. Biol., 2013)

The balanced minimum evolution problem under uncertain data. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti (Discret. Appl. Math., 2013)

An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. - Daniele Catanzaro; Martine Labbé; Bjarni V. Halldórsson (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem. - Daniele Catanzaro; Céline Engelbeen (Algorithms, 2015)

A branch-price-and-cut algorithm for the minimum evolution problem. - Daniele Catanzaro; Roberto Aringhieri; Marco Di Summa; Raffaele Pesenti (Eur. J. Oper. Res., 2015)

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. - Daniele Catanzaro; Luis Eduardo Neves Gouveia; Martine Labbé (Eur. J. Oper. Res., 2015)

Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study. - Daniele Catanzaro; Stanley E. Shackney; Alejandro A. Schäffer; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2016)

Max point-tolerance graphs. - Daniele Catanzaro; Steven Chaplick; Stefan Felsner; Bjarni V. Halldórsson; Magnús M. Halldórsson; Thomas Hixon; Juraj Stacho (Discret. Appl. Math., 2017)

A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs. - Luciano Porretta; Daniele Catanzaro; Bjarni V. Halldórsson; Bernard Fortz (4OR, 2019)

Enumerating vertices of the balanced minimum evolution polytope. - Daniele Catanzaro; Raffaele Pesenti (Comput. Oper. Res., 2019)

On the Balanced Minimum Evolution polytope. - Daniele Catanzaro; Raffaele Pesenti; Laurence A. Wolsey (Discret. Optim., 2020)

An information theory perspective on the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Raffaele Pesenti (Oper. Res. Lett., 2020)

A new fast and accurate heuristic for the Automatic Scene Detection Problem. - Daniele Catanzaro; Raffaele Pesenti; Roberto Ronco (Comput. Oper. Res., 2021)

A tutorial on the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Olivier Gascuel; Raffaele Pesenti (Eur. J. Oper. Res., 2022)

On the exact separation of cover inequalities of maximum-depth. - Daniele Catanzaro; Stefano Coniglio; Fabio Furini (Optim. Lett., 2022)

Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey. - Daniele Catanzaro; Raffaele Pesenti; Roberto Ronco (Eur. J. Oper. Res., 2023)

An evolution strategy approach for the balanced minimum evolution problem. - Andrea Gasparin; Federico Julian Camerota Verdù; Daniele Catanzaro; Lorenzo Castelli (Bioinform., 2023)

A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem. - Daniele Catanzaro; Martin Frohn; Olivier Gascuel; Raffaele Pesenti (Comput. Oper. Res., 2023)

Deep Reinforcement Learning for inventory optimization with non-stationary uncertain demand. - Henri Dehaybe; Daniele Catanzaro; Philippe Chevalier (Eur. J. Oper. Res., 2024)

A Dynamic Programming Approach for the Job Sequencing and Tool Switching Problem. - Emma Legrand; Vianney Coppé; Daniele Catanzaro; Pierre Schaus (CPAIOR (2), 2025)