An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

DOI10.1007/S10479-006-0049-0MaRDI QIDQ863567zbMATH OpenOpenAlexWikidataFDO

Authors Thomas L. Magnanti, Luis Gouveia, Cristina Requejo

Publication date 5 February 2007

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0049-0

zbMATH Keywords

network flowsdiameter constrained treeshop-indexed models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• Minimum Diameter Spanning Trees and Related Problems
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Cites work

• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• scientific article; zbMATH DE number 1439494 (Why is no real title available?)
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Cited in

(8)

• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• The two-level diameter constrained spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• Some recent contributions to network optimization
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• Hop constrained Steiner trees with multiple root nodes

This page was built for publication: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

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