Balanced spanning forests and trees

DOI10.1002/NET.3230210605MaRDI QIDQ3984286zbMATH OpenOpenAlexFDO

Authors Agha Iqbal Ali, Chung-Hsing Huang

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 relaxationlower and upper boundsspanning foreststrees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 437549
• scientific article; zbMATH DE number 795222
• A branch-and-bound algorithm for the mini-max spanning forest problem
• scientific article; zbMATH DE number 3891405

Cites work

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

Cited in

(6)

• On the complexity of graph tree partition problems.
• Looking for edge-equitable spanning trees
• scientific article; zbMATH DE number 1195780 (Why is no real title available?)
• Balanced ordered trees
• Rank-Balanced Trees
• Computational methods for logistics problems related to optimal trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984286)