{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:37:31Z","timestamp":1767137851354,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_32","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"371-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Asymmetric Connected Facility Location Polytope"],"prefix":"10.1007","author":[{"given":"Markus","family":"Leitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Jos\u00e9","family":"Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Sinnl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","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":"3","key":"32_CR2","doi-asserted-by":"publisher","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. Math. Model. Algorithms 10(3), 245\u2013267 (2011)","journal-title":"J. Math. Model. Algorithms"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Leitner, M., Ljubi\u0107, I., Salazar-Gonz\u00e1lez, J.J., Sinnl, M.: The connected facility location polytope: valid inequalities, facets and a computational study. Submitted (2014)","DOI":"10.1007\/978-3-319-14115-2_32"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01586946","volume":"51","author":"M Fischetti","year":"1991","unstructured":"Fischetti, M.: Facets of two Steiner arborescence polyhedra. Math. Program. 51, 401\u2013419 (1991)","journal-title":"Math. Program."},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01583779","volume":"23","author":"G Cornuejols","year":"1982","unstructured":"Cornuejols, G., Thizy, J.M.: Some facets of the simple plant location polytope. Math. Program. 23(1), 50\u201374 (1982)","journal-title":"Math. Program."},{"key":"32_CR6","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"32_CR7","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BFb0120893","volume-title":"Combinatorial Optimization","author":"M Guignard","year":"1980","unstructured":"Guignard, M.: Fractional vertices, cuts and facets of the simple plant location problem. In: Padberg, M. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 150\u2013162. Springer, Heidelberg (1980)"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1287\/ijoc.1090.0375","volume":"22","author":"MG 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."},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44808-X_3","volume-title":"Algorithm Engineering and Experimentation","author":"J Cirasella","year":"2001","unstructured":"Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 32\u201359. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:11:15Z","timestamp":1703193075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":9,"aliases":["10.1007\/978-3-319-14115-2_32"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}