{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T03:56:29Z","timestamp":1703217389874},"reference-count":50,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p> Local Access Networks (LACNs) are often considered the \"last mile\" over the Internet provided that they are connected to some existing Wide Area Network backbone. In this paper, a revised LACN-WAN interconnection model is presented as an extension to the conventional Capacitated Concentrator Location Problem (CCLP). An efficient heuristic is also developed to seek near-optimal deployment of telecommunication devices (e.g. links, concentrators, etc.) while minimizing the total connection costs for the network interconnection. Our solution algorithm could serve as a decision-making tool in solving problems with a real world size (i.e. 120 nodes and 30 concentrators). <\/jats:p>","DOI":"10.1142\/s0219622003000835","type":"journal-article","created":{"date-parts":[[2004,2,9]],"date-time":"2004-02-09T10:41:20Z","timestamp":1076323280000},"page":"597-617","source":"Crossref","is-referenced-by-count":4,"title":["A GRASP HEURISTIC FOR SOLVING AN EXTENDED CAPACITATED CONCENTRATOR  LOCATION PROBLEM"],"prefix":"10.1142","volume":"02","author":[{"given":"BERNARD T.","family":"HAN","sequence":"first","affiliation":[{"name":"Department of Business Information Systems, Haworth College of Business, Western Michigan University, Kalamazoo,  MI 49008, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. T.","family":"RAJA","sequence":"additional","affiliation":[{"name":"Department of Information Management, 200 Bexell Hall, College of Business, Oregon State University, Corvallis,  OR 97331-2603, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/49.842984"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90181-8"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/26.2769"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90204-M"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01783514"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1986.84"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(87)90022-0"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/26.46509"},{"key":"rf9","volume-title":"Computer Networks","author":"Tanenbaum A. S.","year":"1982"},{"key":"rf10","unstructured":"G.\u00a0Held, Network Management \u2014 Techniques, Tools and Systems (John Wiley and Sons, 1992)\u00a0pp. 71\u201372."},{"key":"rf11","volume":"23","author":"Raja V. T.","journal-title":"Telecommunication Systems"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1993.83"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150102"},{"key":"rf14","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1109\/TCOM.1981.1094884","volume":"29","author":"Mirzaian A.","journal-title":"IEEE Transactions on Communications"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90054-K"},{"key":"rf16","first-page":"44","volume":"11","author":"Laguna M.","journal-title":"Journal on Computing"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009736921890"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00083-0"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600521"},{"key":"rf20","first-page":"211","volume":"5","author":"Arg\u00fcello M. F.","journal-title":"Journal on Combinatorial Optimization"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600445"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E"},{"key":"rf23","first-page":"155","volume":"28","author":"Feo T.","journal-title":"IIE Trans. Scheduling & Logistics"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(95)00084-4"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"rf26","volume-title":"State of the Art Handbook in Metaheuristics","author":"Resende M. G. C.","year":"2002"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1093947"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093710"},{"key":"rf30","first-page":"1","volume":"6","author":"Schneider G. M.","journal-title":"Computer Networks"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1016\/0140-3664(92)90079-T"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02094332"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110205"},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1109\/26.2769"},{"key":"rf35","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(90)90114-8"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1080\/02331939008843606"},{"key":"rf37","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120402"},{"key":"rf38","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"rf39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"rf40","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(91)90001-8"},{"key":"rf41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01471113"},{"key":"rf42","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009691028143"},{"key":"rf43","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00213-0"},{"key":"rf44","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.12.1415"},{"key":"rf45","doi-asserted-by":"publisher","DOI":"10.1080\/07408179108963843"},{"key":"rf46","doi-asserted-by":"publisher","DOI":"10.1007\/BF02060483"},{"key":"rf47","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009677613792"},{"key":"rf48","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011237503342"},{"key":"rf49","unstructured":"P.\u00a0Pardalos, L.\u00a0Pitsoulis and M.\u00a0Resende, Parallel Algorithms for Irregular Problems, eds. A.\u00a0Ferreira and J.\u00a0Rolim (Kluwer, 1995)\u00a0pp. 111\u2013130."},{"key":"rf50","first-page":"575","volume":"1180","author":"Pitsoulis L.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622003000835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:10:25Z","timestamp":1565133025000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622003000835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":50,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0219622003000835"],"URL":"https:\/\/doi.org\/10.1142\/s0219622003000835","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}