The 2-hop spanning tree problem

DOI10.1016/S0167-6377(98)00029-7zbMath0957.90093MaRDI QIDQ1306467

Geir Dahl

Publication date: 4 October 1999

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

integer programmingpolyhedrahop-constrained spanning tree

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (12)

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem ⋮ Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ Minimax flow tree problems ⋮ Exact algorithms for finding constrained minimum spanning trees ⋮ Network design for time‐constrained delivery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stable Set Polytopes for a Class of Circulant Graphs

This page was built for publication: The 2-hop spanning tree problem