{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T13:44:06Z","timestamp":1698068646141},"reference-count":23,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6007,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1990,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The resource\u2010constrained minimum weighted arborescence problem, a 0\u20101 integer programming model with application in hierarchical distribution network design, is introduced. Since the model is NP\u2010hard, an enumeration method is required to solve it to optimality. Lagrangean decomposition, a special form of Lagrangean relaxation, is applied to the model. Both analytically and empirically, Lagrangean decomposition is shown to improve on bounds obtained by a conventional Lagrangean relaxation. An enumeration algorithm, that embeds a specialized Lagrangean dual ascent scheme to solve a Lagrangean decomposition dual, is designed, and problems with up to 1000 0\u20101 variables are solved.<\/jats:p>","DOI":"10.1002\/net.3230200306","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T09:18:22Z","timestamp":1178961502000},"page":"345-359","source":"Crossref","is-referenced-by-count":16,"title":["An application of lagrangean decomposition to the resource\u2010constrained minimum weighted arborescence problem"],"prefix":"10.1002","volume":"20","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]},{"given":"Moshe B.","family":"Rosenwein","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(82)90026-0"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121091"},{"key":"e_1_2_1_4_2","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"4","author":"Chu Y.","year":"1965","journal-title":"Sci. Sinica"},{"key":"e_1_2_1_4_3","unstructured":"Math. Rev. 1965 33 1245"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241754"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120402"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322367"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096250"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120690"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580728"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592954"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1051\/ro\/1987210403071","article-title":"Lagrangean decomposition for integer programming: Theory and applications","volume":"21","author":"Guignard M.","year":"1987","journal-title":"RAIRO"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90213-0"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"e_1_2_1_15_2","unstructured":"K.J\u00f6rnsten M.N\u00e4sberg andP.Smeds Variable splitting\u2013A new Lagrangean relaxation approach to some mathematical programming models. Department of Mathematics Report MAT\u2010R\u201085\u201004 Linkoping Institute of Technology Sweden (1985)."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010305"},{"key":"e_1_2_1_17_2","unstructured":"S.MartelloandP.Toth An algorithm for the generalized assignment problem. Proceedings of the 9th IFORS Conference Hamburg Germany (1981)."},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03004231","article-title":"Plus courts chemins avec constraints: Algorithmes et applications","volume":"30","author":"Minoux M.","year":"1975","journal-title":"Ann. Telecommun."},{"key":"e_1_2_1_19_2","first-page":"303","article-title":"Solving hard constrained shortest path problem by Lagrangean relaxation and branch\u2010and\u2010bound algorithms","volume":"53","author":"Ribeiro C.","year":"1986","journal-title":"Methods Operations Res."},{"key":"e_1_2_1_20_2","unstructured":"M.Rosenwein Design and application of solution methodologies to optimize problems in transportation logistics. Ph. D. Dissertation Department of Decision Sciences University of Pennsylvania (1986)."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.992"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130203"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230200306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230200306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T22:13:36Z","timestamp":1698012816000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230200306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["10.1002\/net.3230200306"],"URL":"https:\/\/doi.org\/10.1002\/net.3230200306","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}