{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T12:10:46Z","timestamp":1698149446070},"reference-count":21,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5489,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1991,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This work addresses spanning forests and trees in which the number of nodes in component subtrees is balanced. The solution procedure developed makes use of Lagrangean relaxation and heuristics. Dual\u2010ascent procedures in conjunction with heuristics are used to yield lower and upper bounds. Computational experience indicates that optimal or suboptimal solutions with very tight bounds can be obtained in 180 to 300 iterations on the average for 100\u2010node balanced tree problems and 700 to 1400 iterations for 100\u2010node balanced forest problems.<\/jats:p>","DOI":"10.1002\/net.3230210605","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T11:21:28Z","timestamp":1178968888000},"page":"667-687","source":"Crossref","is-referenced-by-count":1,"title":["Balanced spanning forests and trees"],"prefix":"10.1002","volume":"21","author":[{"given":"Agha Iqbal","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung\u2010Hsing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207728808964068"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(86)90087-9"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.331"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584228"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90014-8"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030204"},{"key":"e_1_2_1_8_2","volume-title":"Graph Theory with Application to Engineering and Computer Science","author":"Deo N.","year":"1976"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90042-7"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120402"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322367"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096250"},{"key":"e_1_2_1_13_2","unstructured":"B.GavishandK.Altinkemer Parallel savings heuristics for the topological design of local access tree networks.Proceed. IEEE\u2014INFOCOM '86(1986)130\u2013139."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-7557-9_10"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.527"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130211"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094601"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322309"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90056-3"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230210605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230210605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T03:43:35Z","timestamp":1698032615000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230210605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["10.1002\/net.3230210605"],"URL":"https:\/\/doi.org\/10.1002\/net.3230210605","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}