Balanced spanning forests and trees

DOI10.1002/net.3230210605zbMath0741.90076OpenAlexW1976117692MaRDI QIDQ3984286

Chung-Hsing Huang, Agha Iqbal Ali

Publication date: 27 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210605

zbMATH Keywords

heuristicsLagrangean relaxationtreeslower and upper boundsspanning forests

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)

Related Items (1)

On the complexity of graph tree partition problems.

Cites Work

• The complexity of restricted spanning tree problems
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

This page was built for publication: Balanced spanning forests and trees