Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
From MaRDI portal
Recommendations
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- An efficient mixed integer linear programming model for the minimum spanning tree problem
- On the weight-constrained minimum spanning tree problem
- The balanced minimum evolution problem
- The node-weighted steiner tree problem
Cites work
- scientific article; zbMATH DE number 4145711 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A branch-price-and-cut algorithm for the minimum evolution problem
- A constructive algorithm for realizing a distance matrix
- A note on distance matrices with unicyclic graph realizations
- A note on the metric properties of trees
- A robust model for finding optimal evolutionary tree
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Approximating the balanced minimum evolution problem
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Distance matrix of a graph and its realizability
- Distance realization problems with applications to internet tomography
- Extended similarity trees
- Hierarchical Inference of Unicast Network Topologies Based on End-to-End Measurements
- Integer Programming Formulation of Traveling Salesman Problems
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Multicast topology inference from measured end-to-end loss
- Multicommodity flow models for spanning trees with hop constraints
- Network Tomography Based on Additive Metrics
- Network delay inference from additive metrics
- On the distance matrix of a tree
- Optimal realizations of generic five-point metrics
- Reducing Delivery Delay in HRM Tree
- Submatrices of non-tree-realizable distance matrices
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- The balanced minimum evolution problem
- The distance matrix of a graph and its tree realization
- The minimum evolution problem: Overview and classification
- Trees related to realizations of distance matrices
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Cited in
(5)- Analysis of models for the stochastic outpatient procedure scheduling problem
- Topology reconstruction using time series data in telecommunication networks
- Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
This page was built for publication: Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752190)
