{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:26:59Z","timestamp":1743031619116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319730127"},{"type":"electronic","value":"9783319730134"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73013-4_27","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T19:19:27Z","timestamp":1513797567000},"page":"295-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity"],"prefix":"10.1007","author":[{"given":"Edward","family":"Gimadi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"27_CR1","first-page":"3","volume":"29","author":"AA Ageev","year":"1989","unstructured":"Ageev, A.A.: Graphs, matrices and the simple plant location problem (in Russian). Upravlyaemye Sistemy 29, 3\u201312 (1989)","journal-title":"Upravlyaemye Sistemy"},{"key":"27_CR2","first-page":"3","volume":"30","author":"AA Ageev","year":"1990","unstructured":"Ageev, A.A.: A polynomial algorithm for solving the location problem on a series-parallel network (in Russian). Upravlyaemye Sistemy 30, 3\u20136 (1990)","journal-title":"Upravlyaemye Sistemy"},{"issue":"1\u20133","key":"27_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(94)90200-3","volume":"49","author":"A Billionet","year":"1994","unstructured":"Billionet, A., Costa, M.-C.: Solving the uncapacitated plant location problem on trees. Discrete Appl. Math. 49(1\u20133), 51\u201359 (1994)","journal-title":"Discrete Appl. Math."},{"key":"27_CR4","unstructured":"Gadegaard, S.L.: Discrete Location Problems. A Ph.D. dissertation, 150 p. Aarhus University Department of Economics and Business Economics (2016)"},{"key":"27_CR5","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979). 338 p"},{"key":"27_CR6","first-page":"12","volume":"23","author":"EK Gimadi","year":"1983","unstructured":"Gimadi, E.K.: An efficient algorithm for solving plant location problem with service regions connected with respect to an acyclic network (in Russian). Upravlyaemye Sistemy 23, 12\u201323 (1983)","journal-title":"Upravlyaemye Sistemy"},{"key":"27_CR7","first-page":"38","volume":"25","author":"EK Gimadi","year":"1984","unstructured":"Gimadi, E.K.: The problem of location on a network with centrally connected service areas (in Russian). Upravlyaemye Sistemy 25, 38\u201347 (1984)","journal-title":"Upravlyaemye Sistemy"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/0607043","volume":"7","author":"R Hassin","year":"1986","unstructured":"Hassin, R., Tamir, A.: Efficient algorithm for optimization and selection on series-parallel graphs. SIAM J. Algebraic Discrete Methods 7(3), 379\u2013389 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/0377-2217(83)90197-2","volume":"12","author":"A Kolen","year":"1983","unstructured":"Kolen, A.: Solving covering problems and the uncapacitated plant location on the trees. Eur. J. Oper. Res. 12(3), 266\u2013278 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Location Science","year":"2015","unstructured":"Laporte, G., Nickel, S., da Gama, F.S. (eds.): Location Science. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5. 644 p."},{"key":"27_CR11","unstructured":"Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York\/Chichester\/Brisbane\/Toronto\/Singapore (1990). 555 p"},{"issue":"3","key":"27_CR12","first-page":"547","volume":"231","author":"VA Trubin","year":"1976","unstructured":"Trubin, V.A.: An efficient algorithm for plant locating on trees (in Russian). Dokl. AN SSSR 231(3), 547\u2013550 (1976)","journal-title":"Dokl. AN SSSR"},{"issue":"7","key":"27_CR13","first-page":"2487","volume":"9","author":"Z Ulukan","year":"2015","unstructured":"Ulukan, Z., Demircioglu, E.: A survey of discrete facility location problems. Int. J. Soc. Behav. Educ. Econ. Bus. Ind. Eng. 9(7), 2487\u20132492 (2015)","journal-title":"Int. J. Soc. Behav. Educ. Econ. Bus. Ind. Eng."},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73013-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:14:40Z","timestamp":1710324880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73013-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319730127","9783319730134"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73013-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}