Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Balanced spanning forests and trees

From MaRDI portal
Publication:3984286
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3984286&oldid=12036376"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki