Daniele Catanzaro

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 13

Top Topics

Integer Linear Programming

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Discret. Optim.

Publications

Henri Dehaybe, Daniele Catanzaro, Philippe Chevalier
Deep Reinforcement Learning for inventory optimization with non-stationary uncertain demand. Eur. J. Oper. Res. 314 (2) (2024)
Daniele Catanzaro, Raffaele Pesenti, Roberto Ronco
Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey. Eur. J. Oper. Res. 308 (3) (2023)
Daniele Catanzaro, Martin Frohn, Olivier Gascuel, Raffaele Pesenti
A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem. Comput. Oper. Res. 158 (2023)
Andrea Gasparin, Federico Julian Camerota Verdù, Daniele Catanzaro, Lorenzo Castelli
An evolution strategy approach for the balanced minimum evolution problem. Bioinform. 39 (10) (2023)
Daniele Catanzaro, Martin Frohn, Olivier Gascuel, Raffaele Pesenti
A tutorial on the balanced minimum evolution problem. Eur. J. Oper. Res. 300 (1) (2022)
Daniele Catanzaro, Stefano Coniglio, Fabio Furini
On the exact separation of cover inequalities of maximum-depth. Optim. Lett. 16 (2) (2022)
Daniele Catanzaro, Raffaele Pesenti, Roberto Ronco
A new fast and accurate heuristic for the Automatic Scene Detection Problem. Comput. Oper. Res. 136 (2021)
Daniele Catanzaro, Martin Frohn, Raffaele Pesenti
An information theory perspective on the balanced minimum evolution problem. Oper. Res. Lett. 48 (3) (2020)
Daniele Catanzaro, Raffaele Pesenti, Laurence A. Wolsey
On the Balanced Minimum Evolution polytope. Discret. Optim. 36 (2020)
Daniele Catanzaro, Raffaele Pesenti
Enumerating vertices of the balanced minimum evolution polytope. Comput. Oper. Res. 109 (2019)
Luciano Porretta, Daniele Catanzaro, Bjarni V. Halldórsson, Bernard Fortz
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs. 4OR 17 (1) (2019)
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
Max point-tolerance graphs. Discret. Appl. Math. 216 (2017)
Daniele Catanzaro, Stanley E. Shackney, Alejandro A. Schäffer, Russell Schwartz
Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study. IEEE ACM Trans. Comput. Biol. Bioinform. 13 (4) (2016)
Daniele Catanzaro, Roberto Aringhieri, Marco Di Summa, Raffaele Pesenti
A branch-price-and-cut algorithm for the minimum evolution problem. Eur. J. Oper. Res. 244 (3) (2015)
Daniele Catanzaro, Céline Engelbeen
An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem. Algorithms 8 (4) (2015)
Daniele Catanzaro, Luis Eduardo Neves Gouveia, Martine Labbé
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. Eur. J. Oper. Res. 244 (3) (2015)
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
Max Point-Tolerance Graphs. CoRR (2015)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti
The balanced minimum evolution problem under uncertain data. Discret. Appl. Math. 161 (13-14) (2013)
Daniele Catanzaro, Ramamoorthi Ravi, Russell Schwartz
A mixed integer linear programming model to reconstruct phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion. Algorithms Mol. Biol. 8 (2013)
Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (6) (2013)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24 (2) (2012)
Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. ISBRA (2012)
Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann
Reduction approaches for robust shortest path problems. Comput. Oper. Res. 38 (11) (2011)
Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa
Optimal solutions for the balanced minimum evolution problem. Comput. Oper. Res. 38 (12) (2011)
Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy
A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput. Oper. Res. 38 (2) (2011)
Daniele Catanzaro, Alessandra Godi, Martine Labbé
A Class Representative Model for Pure Parsimony Haplotyping. INFORMS J. Comput. 22 (2) (2010)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. Networks 53 (2) (2009)
Daniele Catanzaro, Martine Labbé
The pure parsimony haplotyping problem: overview and computational advances. Int. Trans. Oper. Res. 16 (5) (2009)
Daniele Catanzaro
The minimum evolution problem: Overview and classification. Networks 53 (2) (2009)
Roberto Aringhieri, Chiara Braghin, Daniele Catanzaro
An Exact Approach for solving the Balanced Minimum Evolution Problem. CTW (2008)
Daniele Catanzaro, Raffaele Pesenti, Michel C. Milinkovitch
A non-linear optimization procedure to estimate distances and instantaneous substitution rate matrices under the GTR model. Bioinform. 22 (6) (2006)