Exact algorithms for minimum routing cost trees

DOI10.1002/NET.10022MaRDI QIDQ4537623zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Giuseppe Lancia, Paolo Serafini

Publication date 1 July 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10022

zbMATH Keywords

branch and pricecomputational biologynetwork design

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10)

Recommendations

• scientific article; zbMATH DE number 1303537
• Approximation algorithms for tree alignment with a given phylogeny
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• Spanning Trees and Optimization Problems
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm

Cites work

• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Exact and approximate algorithms for optimal network design
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Optimum Communication Spanning Trees
• The complexity of the network design problem
• Worst-Case Analysis of Network Design Problem Heuristics

Cited in

(27)

• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• On the complexity of an optimal routing tree problem
• Compact vs. exponential-size LP relaxations
• Combined column-and-row-generation for the optimal communication spanning tree problem
• Mathematical programming in computational biology: an annotated bibliography
• An integer linear programming formulation for the minimum cardinality segmentation problem
• Approximation algorithms for the optimal \(p\)-source communication spanning tree
• Solving the optimum communication spanning tree problem
• Special issue on: Optimization methods for decision making: advances and applications
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
• On the minimum routing cost clustered tree problem
• The balanced minimum evolution problem
• Models and algorithms for network reduction
• Integer Linear Programming in Computational Biology
• scientific article; zbMATH DE number 1303537 (Why is no real title available?)
• scientific article; zbMATH DE number 2086374 (Why is no real title available?)
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• New valid inequalities for the optimal communication spanning tree problem
• Optimization in telecommunication networks
• Deriving compact extended formulations via LP-based separation techniques
• Deriving compact extended formulations via LP-based separation techniques
• Lagrangean bounds for the optimum communication spanning tree problem
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Spanning trees: A survey
• Designing a road network for hazardous materials shipments
• On the intercluster distance of a tree metric
• On the minimum average distance spanning tree of the hypercube

This page was built for publication: Exact algorithms for minimum routing cost trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537623)