default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Catanzaro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Henri Dehaybe
, Daniele Catanzaro, Philippe Chevalier:
Deep Reinforcement Learning for inventory optimization with non-stationary uncertain demand. Eur. J. Oper. Res. 314(2): 433-445 (2024)- 2023
- [j27]Andrea Gasparin, Federico Julian Camerota Verdù, Daniele Catanzaro, Lorenzo Castelli:
An evolution strategy approach for the balanced minimum evolution problem. Bioinform. 39(10) (2023) - [j26]Daniele Catanzaro, Martin Frohn, Olivier Gascuel, Raffaele Pesenti:
A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem. Comput. Oper. Res. 158: 106308 (2023) - [j25]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): 1091-1109 (2023) - 2022
- [j24]Daniele Catanzaro, Martin Frohn, Olivier Gascuel, Raffaele Pesenti:
A tutorial on the balanced minimum evolution problem. Eur. J. Oper. Res. 300(1): 1-19 (2022) - [j23]Daniele Catanzaro, Stefano Coniglio, Fabio Furini:
On the exact separation of cover inequalities of maximum-depth. Optim. Lett. 16(2): 449-469 (2022) - 2021
- [j22]Daniele Catanzaro, Raffaele Pesenti, Roberto Ronco:
A new fast and accurate heuristic for the Automatic Scene Detection Problem. Comput. Oper. Res. 136: 105495 (2021) - 2020
- [j21]Daniele Catanzaro, Raffaele Pesenti, Laurence A. Wolsey:
On the Balanced Minimum Evolution polytope. Discret. Optim. 36: 100570 (2020) - [j20]Daniele Catanzaro, Martin Frohn, Raffaele Pesenti:
An information theory perspective on the balanced minimum evolution problem. Oper. Res. Lett. 48(3): 362-367 (2020)
2010 – 2019
- 2019
- [j19]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): 75-96 (2019) - [j18]Daniele Catanzaro, Raffaele Pesenti:
Enumerating vertices of the balanced minimum evolution polytope. Comput. Oper. Res. 109: 209-217 (2019) - 2017
- [j17]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: 84-97 (2017) - 2016
- [j16]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): 643-655 (2016) - 2015
- [j15]Daniele Catanzaro, Céline Engelbeen:
An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem. Algorithms 8(4): 999-1020 (2015) - [j14]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): 753-765 (2015) - [j13]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): 766-777 (2015) - [i1]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max Point-Tolerance Graphs. CoRR abs/1508.03810 (2015) - 2013
- [j12]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: 3 (2013) - [j11]Daniele Catanzaro, Martine Labbé, Raffaele Pesenti:
The balanced minimum evolution problem under uncertain data. Discret. Appl. Math. 161(13-14): 1789-1804 (2013) - [j10]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): 1391-1402 (2013) - 2012
- [j9]Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González:
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24(2): 276-294 (2012) - [c2]Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson:
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. ISBRA 2012: 24-35 - 2011
- [j8]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): 539-549 (2011) - [j7]Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann:
Reduction approaches for robust shortest path problems. Comput. Oper. Res. 38(11): 1610-1619 (2011) - [j6]Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa:
Optimal solutions for the balanced minimum evolution problem. Comput. Oper. Res. 38(12): 1845-1854 (2011) - [p1]Daniele Catanzaro:
Estimating Phylogenies from Molecular Data. Mathematical Approaches to Polymer Sequence Analysis and Related Problems 2011: 149-176 - 2010
- [j5]Daniele Catanzaro, Alessandra Godi, Martine Labbé:
A Class Representative Model for Pure Parsimony Haplotyping. INFORMS J. Comput. 22(2): 195-209 (2010)
2000 – 2009
- 2009
- [j4]Daniele Catanzaro, Martine Labbé:
The pure parsimony haplotyping problem: overview and computational advances. Int. Trans. Oper. Res. 16(5): 561-584 (2009) - [j3]Daniele Catanzaro:
The minimum evolution problem: Overview and classification. Networks 53(2): 112-125 (2009) - [j2]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): 126-140 (2009) - 2008
- [c1]Roberto Aringhieri, Chiara Braghin, Daniele Catanzaro:
An Exact Approach for solving the Balanced Minimum Evolution Problem. CTW 2008: 48-51 - 2006
- [j1]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): 708-715 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
