( en | de | ru )

 

Disambiguation of "Catanzaro, Daniele"

Author of the publication

copydeleteadd this publication to your clipboard
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs.

, , , and . 4OR, 17 (1): 75-96 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christl Catanzaro

Daniele Soroldoni

Daniele Silvestro

Daniele Palmisano

Daniele Suzzi

 

Other publications of authors with the same name

Max Point-Tolerance Graphs, , , , , , and . CoRR, (2015)Improved integer linear programming formulations for the job Sequencing and tool Switching Problem., , and . Eur. J. Oper. Res., 244 (3): 766-777 (2015)Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion., , , and . Networks, 53 (2): 126-140 (2009)Estimating Phylogenies from Molecular Data.. Mathematical Approaches to Polymer Sequence Analysis and Related Problems, Springer, (2011)Enumerating vertices of the balanced minimum evolution polytope., and . Comput. Oper. Res., (2019)A branch-and-cut algorithm for the partitioning-hub location-routing problem., , , and . Comput. Oper. Res., 38 (2): 539-549 (2011)A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem., , , and . Comput. Oper. Res., (October 2023)On the exact separation of cover inequalities of maximum-depth., , and . Optim. Lett., 16 (2): 449-469 (2022)The pure parsimony haplotyping problem: overview and computational advances., and . Int. Trans. Oper. Res., 16 (5): 561-584 (2009)On the Balanced Minimum Evolution polytope., , and . Discret. Optim., (2020)