{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:52:50Z","timestamp":1743119570706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030712136"},{"type":"electronic","value":"9783030712143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-71214-3_22","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T11:04:17Z","timestamp":1616583857000},"page":"267-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"Edward Kh.","family":"Gimadi","sequence":"first","affiliation":[]},{"given":"Aleksandr S.","family":"Shevyakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,25]]},"reference":[{"unstructured":"Ageev, A., Ye, Y., Zhan, J.: Improved combinatorial approximation algorithms for the k-Level facility location problem. SIAM J. Discrete Math. 18(1), 207\u2013217 (2004)","key":"22_CR1"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44666-4_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"A Bumb","year":"2001","unstructured":"Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM-2001. LNCS, vol. 2129, pp. 55\u201363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44666-4_10"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)","key":"22_CR3"},{"unstructured":"Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. Wiley, New York (1990)","key":"22_CR4"},{"unstructured":"Gimad, E.Kh.: Effective algorithms for multistage location problem on a path. Diskret. Anal. Issled. Oper. Ser. 1 2(4), 13\u201331 (1995). (in Russian)","key":"22_CR5"},{"doi-asserted-by":"publisher","unstructured":"Gimadi, E.Kh.: Exact algorithm for some multi-level location problems on a chain and a tree. In: Operation Research Proceedings of SOR 1996, Braunschweig, Germany, 1996, pp. 72\u201377. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-60744-8_14","key":"22_CR6","DOI":"10.1007\/978-3-642-60744-8_14"},{"doi-asserted-by":"publisher","unstructured":"Gimadi, E.Kh, Kurochkin, A.A.: An effective algorithm for the two-stage location problem on a tree-like network. J. Appl. Industr. Math. 7(2), 177\u2013186 (2013). https:\/\/doi.org\/10.1134\/S1990478913020063","key":"22_CR7","DOI":"10.1134\/S1990478913020063"},{"unstructured":"Gimadi, E.Kh., Shamardin, Y.V.: On multi-level network facility location problem. In: CEUR Workshop Proceedings, 2018, vol. 2098, pp. 150\u2013158 (2018). EID: 2-s2.0-85047982363","key":"22_CR8"},{"unstructured":"Ortiz-Astorquiza, C., Contreras, I., Laporte, G.: Multi-level facility location problems. Eur. J. Oper. Res. 1\u201315 (2017)","key":"22_CR9"},{"unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms SODA, New Orleans, Louisiana, USA, 11\u201314 January 2004, pp. 808\u2013817. SIAM, Philadelphia (2004)","key":"22_CR10"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71214-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:53:51Z","timestamp":1619225631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-71214-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030712136","9783030712143"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71214-3_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 March 2021","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.33","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}