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

DOI10.1007/s10107-009-0297-2zbMath1237.90132MaRDI 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 location; mixed integer programming models; hop constrained Steiner trees

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Modeling and solving the bi-objective minimum diameter-cost spanning tree problem, Branch-and-cut-and-price for capacitated connected facility location, Extended formulation for hop constrained distribution network configuration problems, Finding outbreak trees in networks with limited information, 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