Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

DOI10.1007/S10107-009-0297-2zbMath1237.90132OpenAlexW2100344930MaRDI QIDQ5891541

Stefan Gollowitzer, Ivana Ljubić

Publication date: 13 May 2012

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0297-2

zbMATH Keywords

connected facility locationmixed integer programming modelshop constrained Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

Finding outbreak trees in networks with limited information ⋮ Extended formulation for hop constrained distribution network configuration problems ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

Cites Work

• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs