{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:57Z","timestamp":1759847757883},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,7]]},"DOI":"10.1016\/s0377-2217(03)00071-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"73-82","source":"Crossref","is-referenced-by-count":6,"title":["Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs"],"prefix":"10.1016","volume":"156","author":[{"given":"Rakesh","family":"Kawatra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Bricker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00071-7_BIB1","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","article-title":"Minimum weight degree constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine","volume":"22","author":"Boldon","year":"1996","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB2","series-title":"Metaheuristics: Theory and Applications","article-title":"Comparison of heuristic algorithms for the degree constrained minimum spanning tree","author":"Craig","year":"1996"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB3","unstructured":"G.F. Campbell, J.R. Pimentel, Topological aspects of MAP network design, in: Proceedings of the 11th Conference on Local Computer Networks, 1986, pp. 34\u201343"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB4","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","article-title":"An efficient algorithm for the min-sum arborescence problem on complete digraphs","volume":"5","author":"Fischetti","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/net.3230080304","article-title":"A good algorithm for smallest spanning trees with a degree constraint","volume":"8","author":"Gabow","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB7","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks: Formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB9","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented Lagrangian based algorithm for centralized network design","volume":"33","author":"Gavish","year":"1985","journal-title":"IEEE Transaction on Communications"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB11","unstructured":"R. Kawatra, A Lagrangian heuristic for the degree constrained minimal spanning tree problem, Working paper, 2001"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/S0377-2217(99)00036-3","article-title":"A multiperiod planning model for the capacitated minimal spanning tree problem","volume":"121","author":"Kawatra","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB13","series-title":"Urban Operations Research","author":"Larson","year":"1981"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","article-title":"Degree constrained minimum spanning tree","volume":"7","author":"Narula","year":"1980","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/26.2769","article-title":"Locating concentrators for primary and secondary coverage in a computer communications network","volume":"36","author":"Pirkul","year":"1988","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0305-0548(85)90032-2","article-title":"Edge exchanges in the degree constrained minimum spanning tree problem","volume":"12","author":"Savelsbergh","year":"1985","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","article-title":"A Lagrangian approach to the degree-constrained minimum spanning tree problem","volume":"39","author":"Volgenant","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01609023","article-title":"The Held\u2013Karp algorithm and degree-constrained minimum 1-tree","volume":"15","author":"Yamamoto","year":"1978","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00071-7_BIB19","first-page":"156","article-title":"Approach to the degree-constrained minimum spanning tree problem using genetic algorithms","volume":"3","author":"Zhou","year":"1997","journal-title":"Engineering Design and Automation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:24:09Z","timestamp":1553228649000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703000717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["S0377221703000717"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00071-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,7]]}}}