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

DOI10.1007/S10479-006-0049-0zbMATH Open1107.90007OpenAlexW2004761333WikidataQ58024608 ScholiaQ58024608MaRDI QIDQ863567FDOQ863567

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

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

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)

Cites Work

• Title not available (Why is that?)
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• Title not available (Why is that?)
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Title not available (Why is that?)
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

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

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)