A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
From MaRDI portal
Publication:3157034
DOI10.1002/net.20034zbMath1058.90069OpenAlexW4254899134WikidataQ58024612 ScholiaQ58024612MaRDI QIDQ3157034
Cristina Requejo, Luís Gouveia, Thomas L. Magnanti
Publication date: 12 January 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20034
Related Items
Hop constrained Steiner trees with multiple root nodes ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees ⋮ Integer models and upper bounds for the 3‐club problem ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ On the characterization of the domination of a diameter-constrained network reliability model ⋮ The two-level diameter constrained spanning tree problem