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

DOI10.1007/s10479-006-0049-0zbMath1107.90007OpenAlexW2004761333WikidataQ58024608 ScholiaQ58024608MaRDI QIDQ863567

Thomas L. Magnanti, Cristina Requejo, Luís Gouveia

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)

Related Items

Hop constrained Steiner trees with multiple root nodes ⋮ Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ Some recent contributions to network optimization ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ 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

Cites Work

• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item