{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:07:19Z","timestamp":1742918839441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967710"},{"type":"electronic","value":"9783030967727"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96772-7_27","type":"book-chapter","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:13:08Z","timestamp":1647378788000},"page":"295-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm for the Facility Location Problem with Origin and Destination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3075-0246","authenticated-orcid":false,"given":"Fengmin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1768-3069","authenticated-orcid":false,"given":"Na","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4351-7213","authenticated-orcid":false,"given":"Wenxing","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: Proceedings of IEEE, Symposium on Foundations of Computer Science. IEEE Computer Society, pp. 256\u2013265 (2014)","key":"27_CR1","DOI":"10.1109\/FOCS.2014.35"},{"unstructured":"Comuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory. Wiley, New York, pp. 119\u2013171 (1990)","key":"27_CR2"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.cie.2019.06.060","volume":"135","author":"A Hh","year":"2019","unstructured":"Hh, A., Zo, B.: An improved scatter search algorithm for the uncapacitated facility location problem. Comput. Ind. Eng. 135, 855\u2013867 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1020715517162","volume":"110","author":"JG Klincewicz","year":"2002","unstructured":"Klincewicz, J.G.: Enumeration and search procedures for a Hub location problem with economies of scale. Ann. Oper. Res. 110, 107\u2013122 (2002)","journal-title":"Ann. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488 Approximation algorithm for the uncapacitated facility location problem. In: Proceedings of the ICALP, Part II, pp. 77\u201388 (2011)","key":"27_CR7","DOI":"10.1007\/978-3-642-22012-8_5"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y Li","year":"2015","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear\/submodular penalties. Algorithmica 73(2), 460\u2013482 (2015)","journal-title":"Algorithmica"},{"unstructured":"Labbe, M., Louveaux, F.V.: Location problems. In: DelPAmico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization. Wiley, Chiehester, UK, pp. 261\u2013281 (1997)","key":"27_CR9"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1007\/s10878-021-00726-0","volume":"41","author":"W Lv","year":"2021","unstructured":"Lv, W., Wu, C.: An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties. J. Comb. Optim. 41(4), 888\u2013904 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00726-0","journal-title":"J. Comb. Optim."},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1504\/IJMOR.2021.112288","volume":"18","author":"NAT Nezhad","year":"2021","unstructured":"Nezhad, N.A.T., Moradi, S., Karamali, G.: Fuzzy facility location problem with point and rectangular destinations. Int. J. Math. Oper. Res. 18(1), 21\u201344 (2021)","journal-title":"Int. J. Math. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Quilliot, A., Sarbinowski, A.: Facility location models for vehicle sharing systems. In: Computer Science Information Systems. IEEE (2016)","key":"27_CR12","DOI":"10.15439\/2016F10"},{"doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tard\u00f6s, \u00c9., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","key":"27_CR13","DOI":"10.1145\/258533.258600"},{"doi-asserted-by":"crossref","unstructured":"Wang, F., Hu, X., Wu, C.: 2-level station location for bike sharing. In: Zhang, Z., Li, W., Du, D.Z. (eds.) Algorithmic Aspects in Information and Management. AAIM 2020 (2020)","key":"27_CR14","DOI":"10.1007\/978-3-030-57602-8_10"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalty. Inf. Process. Lett. 94, 119\u2013123 (2005)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Zhang, J., Pan, X., Li, M., Yu, P.S.: Bicycle-sharing systems expansion: station re-deployment through crowd planning. In: ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems ACM, vol. 2 (2016)","key":"27_CR16","DOI":"10.1145\/2996913.2996926"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96772-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:16:46Z","timestamp":1647379006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96772-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967710","9783030967727"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96772-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.sysu.edu.cn\/pdcat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"97","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":"24","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":"34","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":"25% - 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","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":"7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}