Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
From MaRDI portal
Publication:1752190
DOI10.1016/j.ejor.2016.06.014zbMath1394.90435OpenAlexW2421469926WikidataQ58024581 ScholiaQ58024581MaRDI QIDQ1752190
Olga Oliveira, Bernard Fortz, Cristina Requejo
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.12210/24568
mixed integer linear programmingtopology discoveryminimum evolution problemrouting topology inferencetree realization
Programming involving graphs or networks (90C35) Trees (05C05) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity ⋮ Topology reconstruction using time series data in telecommunication networks ⋮ On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions ⋮ Analysis of models for the stochastic outpatient procedure scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-price-and-cut algorithm for the minimum evolution problem
- Approximating the balanced minimum evolution problem
- A constructive algorithm for realizing a distance matrix
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Optimal realizations of generic five-point metrics
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Extended similarity trees
- Computational complexity of inferring phylogenies from dissimilarity matrices
- A note on distance matrices with unicyclic graph realizations
- Submatrices of non-tree-realizable distance matrices
- On the distance matrix of a tree
- Multicommodity flow models for spanning trees with hop constraints
- Trees related to realizations of distance matrices
- Distance realization problems with applications to internet tomography
- A note on the metric properties of trees
- A robust model for finding optimal evolutionary tree
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- The Balanced Minimum Evolution Problem
- Network delay inference from additive metrics
- Integer Programming Formulation of Traveling Salesman Problems
- Reducing Delivery Delay in HRM Tree
- The distance matrix of a graph and its tree realization
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- Multicast topology inference from measured end-to-end loss
- Hierarchical Inference of Unicast Network Topologies Based on End-to-End Measurements
- The minimum evolution problem: Overview and classification
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Network Tomography Based on Additive Metrics
- Distance matrix of a graph and its realizability
