{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:51:33Z","timestamp":1761893493595},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00325-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"94-108","source":"Crossref","is-referenced-by-count":10,"title":["New modeling approaches for the design of local access transport area networks"],"prefix":"10.1016","volume":"127","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taehyung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00325-2_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01581103","article-title":"Capacitated facility location: Separation algorithms and computational experience","volume":"81","author":"Aardal","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB2","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","article-title":"Capacitated facility location: Valid inequalities and facets","volume":"20","author":"Aardal","year":"1995","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB3","first-page":"239","article-title":"Models for planning capacity expansion in local access telecommunication networks","volume":"33","author":"Balakrishnan","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design \u2013 Polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB5","unstructured":"Cho, G., Shaw, D.X., 1995. Limited column generation for local access telecommunication network design \u2013 Formulations, algorithms, and implementation. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","article-title":"Large-scale network topological optimization","volume":"25","author":"Boorstyn","year":"1977","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB7","first-page":"24.5.1","article-title":"An algorithm for optimally locating network access facilities","author":"Chou","year":"1978","journal-title":"ICC '78"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB8","doi-asserted-by":"crossref","unstructured":"Cook, W., 1990. Integer programming solution for capacity expansion of the local access network. Technical Paper TM-ARH-017914, Bell Communications Research, Murray Hill, NJ","DOI":"10.1007\/BF01580858"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB9","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1992"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","article-title":"On the topological design of distributed computer networks","volume":"25","author":"Gerla","year":"1977","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB11","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","article-title":"Integer polyhedra arising from certain network design problems with connectivity constraints","volume":"3","author":"Gr\u00f6tschel","year":"1990","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB12","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C., Stoer, M., 1991. Polyhedral approaches to network survivability. In: Roberts, F., Hwang, F., Monma, C.L. (Eds.), Reliability of Computer and Communication Networks, vol. 5, Series in Discrete Mathematics and Computer Science, American Mathematical Society, Providence, RI, pp. 121\u2013141","DOI":"10.1090\/dimacs\/005\/08"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints","volume":"40","author":"Gr\u00f6tschel","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0802024","article-title":"Facets for polyhedra arising in the designing of communication networks with low-connectivity constraints","volume":"2","author":"Gr\u00f6tschel","year":"1992","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB15","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C., Stoer, M., 1994. Design of survivable networks. In: Ball, M.O., Magnanti, T.L., Monma, C., Nemhauser, G. (Eds.), Network Models, vol. 6, Handbook of Operations Research and Management Science, North-Holland, Amsterdam","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0377-2217(83)90195-9","article-title":"Heuristic for the capacitated plant location model","volume":"12","author":"Jacobsen","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01587093","article-title":"Valid inequalities and facets of the capacitated plant location problem","volume":"44","author":"Leung","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TCOM.1977.1093710","article-title":"Network design: An algorithm for the access facility location problem","volume":"25","author":"McGregor","year":"1977","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB19","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","article-title":"Valid linear inequalities for fixed charge problems","volume":"33","author":"Padberg","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB20","unstructured":"Shaw, D.X., 1993. Limited column generation technique for several telecommunication network design problems. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB21","unstructured":"Shaw, D.X., 1995. Local access network design and its extensions. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","article-title":"A hierarchy of relaxation and convex hull characterizations for mixed integer zero\u2013one programming problems","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/S0377-2217(99)00325-2_BIB24","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/opre.46.3.396","article-title":"Exploiting special structures in constructing a hierarchy of relaxations for 0\u20131 mixed integer problems","volume":"46","author":"Sherali","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB25","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Choi, G., Tuncbilek, C.H., 2000. A variable target value method for nondifferentiable optimization. Operations Research Letters 26 (1), 1\u20138","DOI":"10.1016\/S0167-6377(99)00063-2"},{"key":"10.1016\/S0377-2217(99)00325-2_BIB26","doi-asserted-by":"crossref","unstructured":"Stoer, M., 1993. Design of Survivable Networks, vol. 1531, Lecture Notes in Mathematics, Springer, Berlin","DOI":"10.1007\/BFb0088963"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:04:22Z","timestamp":1578531862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0377221799003252"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00325-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}