Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

DOI10.1016/j.endm.2008.01.017zbMath1341.05027OpenAlexW2096594922MaRDI QIDQ3503535

Thiago F. Noronha, Andréa Cynthia Santos, Celso Carneiro Ribeiro

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.017

zbMATH Keywords

diameter constrained minimum spanning tree problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)

Related Items (2)

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

Cites Work

• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Unnamed Item

This page was built for publication: Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem