{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T03:33:03Z","timestamp":1778124783563,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T00:00:00Z","timestamp":1361923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10589-013-9544-9","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T18:58:35Z","timestamp":1361905115000},"page":"647-674","source":"Crossref","is-referenced-by-count":15,"title":["A cutting plane algorithm for the Capacitated Connected Facility Location Problem"],"prefix":"10.1007","volume":"55","author":[{"given":"Stefan","family":"Gollowitzer","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,27]]},"reference":[{"issue":"3","key":"9544_CR1","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","volume":"20","author":"K. Aardal","year":"1995","unstructured":"Aardal, K., Pochet, Y., Wolsey, L.A.: Capacitated facility location: valid inequalities and facets. Math. Oper. Res. 20(3), 562\u2013582 (1995)","journal-title":"Math. Oper. Res."},{"key":"9544_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/978-3-642-21527-8_54","volume-title":"INOC","author":"A. Arulselvan","year":"2011","unstructured":"Arulselvan, A., Bley, A., Gollowitzer, S., Ljubic, I., Maurer, O.: MIP modeling of incremental connected facility location. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC. Lecture Notes in Computer Science, vol. 6701, pp. 490\u2013502. Springer, Berlin (2011)"},{"issue":"4","key":"9544_CR3","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1287\/ijoc.1090.0375","volume":"22","author":"M.G. Bardossy","year":"2010","unstructured":"Bardossy, M.G., Raghavan, S.: Dual-based local search for the connected facility location and related problems. INFORMS J. Comput. 22(4), 584\u2013602 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9544_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-008-0375-5","volume":"167","author":"A. Ceselli","year":"2009","unstructured":"Ceselli, A., Liberatore, F., Righini, G.: A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann. Oper. Res. 167(1), 209\u2013251 (2009)","journal-title":"Ann. Oper. Res."},{"key":"9544_CR5","unstructured":"Chouman, M., Crainic, T.G., Gendron, B.: Commodity representations and cutset-based inequalities for multicommodity capacitated fixed-charge network design. Tech. rep. CIRRELT-2011-56, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), CIRRELT (2011)"},{"issue":"1","key":"9544_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","volume":"157","author":"I.A. Contreras","year":"2008","unstructured":"Contreras, I.A., D\u00edaz, J.A.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157(1), 73\u201389 (2008)","journal-title":"Ann. Oper. Res."},{"key":"9544_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9122-0","volume":"42","author":"A.M. Costa","year":"2009","unstructured":"Costa, A.M., Cordeau, J.F., Gendron, B.: Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42, 371\u2013392 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"9544_CR8","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1023\/A:1020325926188","volume":"8","author":"T.G. Crainic","year":"2002","unstructured":"Crainic, T.G., Gendreau, M.: Cooperative parallel tabu search for capacitated network design. J.\u00a0Heuristics 8(6), 601\u2013627 (2002)","journal-title":"J.\u00a0Heuristics"},{"issue":"3","key":"9544_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12(3), 223\u2013236 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20133","key":"9544_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T.G. Crainic","year":"2001","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1\u20133), 73\u201399 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"9544_CR11","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"T.G. Crainic","year":"2004","unstructured":"Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling\/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5), 525\u2013545 (2004)","journal-title":"J. Heuristics"},{"key":"9544_CR12","unstructured":"Deng, Q., Simchi-Levi, D.: Valid inequalities, facets and computational results for the capacitated concentrator location problem. Tech. rep., Department of Industrial Engineering and Operations Research, Columbia University, New York (1992)"},{"key":"9544_CR13","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"J.A. Diaz","year":"2002","unstructured":"Diaz, J.A., Fern\u00e1ndez, E.: A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper. Res. Soc. 53, 728\u2013740 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"9544_CR14","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.jcss.2010.02.001","volume":"76","author":"F. Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., Grandoni, F., Rothvo\u00df, T., Sch\u00e4fer, G.: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76, 709\u2013726 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"9544_CR15","unstructured":"Gendron, B., Larose, M.: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. Tech. rep. CIRRELT-2012-74, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), CIRRELT (2012)"},{"key":"9544_CR16","first-page":"1","volume-title":"Telecommunications Network Planning","author":"B. Gendron","year":"1998","unstructured":"Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Sanso,\u00a0B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 1\u201319. Kluwer Academics, Norwell (1998)"},{"issue":"4","key":"9544_CR17","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I. Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655\u2013667 (2003)","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"9544_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I. Ghamlouche","year":"2004","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1\u20134), 109\u2013133 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9544_CR19","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.cor.2010.07.002","volume":"38","author":"S. Gollowitzer","year":"2011","unstructured":"Gollowitzer, S., Ljubi\u0107, I.: MIP models for connected facility location: a theoretical and computational study. Comput. Oper. Res. 38(2), 435\u2013449 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9544_CR20","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M. Hewitt","year":"2010","unstructured":"Hewitt, M., Nemhauser, G.L., Savelsbergh, M.W.P.: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2), 314\u2013325 (2010)","journal-title":"INFORMS J. Comput."},{"key":"9544_CR21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461\u2013481 (2000)","journal-title":"Oper. Res."},{"issue":"3","key":"9544_CR22","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg, K., R\u00f6nnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113(3), 544\u2013559 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9544_CR23","unstructured":"IBM: CPLEX (November 22nd 2011). http:\/\/www.ilog.com\/products\/cplex\/"},{"issue":"1\u20132","key":"9544_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K. Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.N.: Separation algorithms for 0\u20131 knapsack polytopes. Math. Program. 124(1\u20132), 69\u201391 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"9544_CR25","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.cam.2008.10.055","volume":"232","author":"N. Katayama","year":"2009","unstructured":"Katayama, N., Chen, M., Kubo, M.: A capacity scaling heuristic for the multicommodity capacitated network design problem. J. Comput. Appl. Math. 232(1), 90\u2013101 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9544_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/11561071_7","volume-title":"ESA","author":"G. Kliewer","year":"2005","unstructured":"Kliewer, G., Timajev, L.: Relax-and-cut for capacitated network design. In: Brodal, G.S., Leonardi,\u00a0S. (eds.) ESA. Lecture Notes in Computer Science, vol. 3669, pp. 47\u201358. Springer, Berlin (2005)"},{"issue":"3","key":"9544_CR27","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10852-011-9153-5","volume":"10","author":"M. Leitner","year":"2011","unstructured":"Leitner, M., Raidl, G.R.: Branch-and-cut-and-price for capacitated connected facility location. J.\u00a0Math. Model. Algorithms 10(3), 245\u2013267 (2011)","journal-title":"J.\u00a0Math. Model. Algorithms"},{"key":"9544_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-75514-2_12","volume-title":"Hybrid Metaheuristics","author":"I. Ljubi\u0107","year":"2007","unstructured":"Ljubi\u0107, I.: A hybrid VNS for connected facility location. In: Bartz-Beielstein, T., Aguilera, M.J.B., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 4771, pp. 157\u2013169. Springer, Berlin (2007)"},{"issue":"1","key":"9544_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.20481","volume":"59","author":"I. Ljubi\u0107","year":"2012","unstructured":"Ljubi\u0107, I., Putz, P., Salazar-Gonz\u00e1lez, J.: Exact approaches to the single-source network loading problem. Networks 59(1), 89\u2013106 (2012)","journal-title":"Networks"},{"key":"9544_CR30","unstructured":"Putz, P.: Fiber to the home, cost optimal design of last-mile broadband telecommunication networks. Ph.D. thesis, University of Vienna (2012)"},{"key":"9544_CR31","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/0-387-29234-9_10","volume-title":"Telecommunications Planning: Innovations in Pricing, Network Design and Management","author":"S. Raghavan","year":"2006","unstructured":"Raghavan, S., Stanojevi\u0107, D.: A note on search by objective relaxation. In: Telecommunications Planning: Innovations in Pricing, Network Design and Management. Operations Research\/Computer Science Interfaces Series, vol. 33, pp. 181\u2013201. Springer, Berlin (2006)"},{"issue":"3","key":"9544_CR32","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.cor.2008.09.003","volume":"37","author":"I. Rodr\u00edguez-Mart\u00edn","year":"2010","unstructured":"Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J.: A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37(3), 575\u2013581 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9544_CR33","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.1070.0237","volume":"20","author":"F.S. Salman","year":"2008","unstructured":"Salman, F.S., Ravi, R., Hooker, J.N.: Solving the capacitated local access network design problem. INFORMS J. Comput. 20(2), 243\u2013254 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9544_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/3-540-45749-6_73","volume-title":"Algorithms\u2014ESA 2002","author":"M. Sellmann","year":"2002","unstructured":"Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. In: M\u00f6hring, R., Raman, R. (eds.) Algorithms\u2014ESA 2002. Lecture Notes in Computer Science, vol. 2461, pp. 845\u2013858. Springer, Berlin (2002)"},{"key":"9544_CR35","unstructured":"Wassermann, B.: Operations Research in action: a project for designing telecommunication access networks. Ph.D. thesis, University of Vienna (2012)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9544-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9544-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9544-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:34Z","timestamp":1559241454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9544-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,27]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9544"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9544-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,27]]}}}