{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T04:29:21Z","timestamp":1712118561733},"reference-count":17,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"Funda\u00e7\u02dco para a Ci\u00eancia e Technologia","award":["POCTI-ISFL-1-152"],"award-info":[{"award-number":["POCTI-ISFL-1-152"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this article, we consider the notion of \u201creload costs\u201d in network design. Reload costs occur naturally in many different settings including telecommunication networks using diverse technologies. However, reload costs have not been studied extensively in the literature. Given that reload costs occur naturally in many settings, we are motivated by the desire to develop \u201cgood\u201d models for network design problems involving reload costs. In this article, and as a first step in this direction, we propose and discuss the reload cost spanning tree problem (RCSTP). We show that the RCSTP is NP\u2010complete. We discuss several ways of modeling network design problems with reload costs. These involve models that expand the original graph significantly\u2014to a directed line graph and a colored graph\u2014to model reload costs. We show that the different modeling approaches lead to models with the same linear programming bound. We then discuss several variations of reload cost spanning tree and network design problems, and discuss both their complexity and models for these variations. To assess the effectiveness of the proposed models to solve RCSTP instances, we present results taken from instances with up to 50 nodes, 300 edges, and nine technologies for several variations of the problem. \u00a9 2011 Wiley Periodicals, Inc. NETWORKS, 2011<\/jats:p>","DOI":"10.1002\/net.20443","type":"journal-article","created":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T15:51:09Z","timestamp":1312213869000},"page":"365-379","source":"Crossref","is-referenced-by-count":11,"title":["Reload cost trees and network design"],"prefix":"10.1002","volume":"59","author":[{"given":"Ioannis","family":"Gamvros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2011,8]]},"reference":[{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.20423"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199204)39:3<399::AID-NAV3220390309>3.0.CO;2-0"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.5.716"},{"key":"e_1_2_10_5_2","volume-title":"Combinatorial optimization","author":"Cook W.","year":"1998"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_19"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.02.013"},{"key":"e_1_2_10_8_2","unstructured":"I.Gamvros Satellite network design optimization and management Ph.D. Thesis University of Maryland College Park 2006."},{"key":"e_1_2_10_9_2","unstructured":"I.Gamvros L.Gouveia S.Raghavan Reload cost trees and network design Proceedings of the International Network Optimization Conference Spa Belgium 2007."},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230104"},{"key":"e_1_2_10_11_2","volume-title":"Graphs and algorithms","author":"Gondran M.","year":"1984"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95891-8_55"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.03.022"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.3.287"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_2_10_16_2","first-page":"503","volume-title":"Handbooks in operations research and management science","author":"Magnanti T. L.","year":"1995"},{"key":"e_1_2_10_17_2","unstructured":"H. C.Wirth Multicriteria approximation of network design and network upgrade problems Ph.D. Thesis Universit\u00e4t W\u00fcrzburg 2001."},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00392-9"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20443","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20443","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:22:17Z","timestamp":1697606537000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.1002\/net.20443"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/net.20443","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}