{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:14:16Z","timestamp":1743131656425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436116"},{"type":"electronic","value":"9783031436123"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43612-3_33","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:30:04Z","timestamp":1693971004000},"page":"533-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Radius-Based Approach for\u00a0the\u00a0Bi-Objective p-Center and\u00a0p-Dispersion Problem"],"prefix":"10.1007","author":[{"given":"Niels","family":"De Walsche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo S.","family":"Sartori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hatice","family":"\u00c7al\u0131k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"issue":"11","key":"33_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990). https:\/\/doi.org\/10.2307\/2582903","journal-title":"J. Oper. Res. Soc."},{"doi-asserted-by":"publisher","unstructured":"\u00c7al\u0131k, H., Labb\u00e9, M., Yaman, H.: $$p$$-center problems. Location Sci. 51\u201365 (2019). https:\/\/doi.org\/10.1007\/978-3-319-13111-5_4","key":"33_CR2","DOI":"10.1007\/978-3-319-13111-5_4"},{"issue":"12","key":"33_CR3","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1016\/j.cor.2013.07.011","volume":"40","author":"H \u00c7al\u0131k","year":"2013","unstructured":"\u00c7al\u0131k, H., Tansel, B.C.: Double bound method for solving the $$p$$-center location problem. Comput. Oper. Res. 40(12), 2991\u20132999 (2013). https:\/\/doi.org\/10.1016\/j.cor.2013.07.011","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1287\/ijoo.2019.0027","volume":"2","author":"C Contardo","year":"2020","unstructured":"Contardo, C.: Decremental clustering for the solution of $$p$$-dispersion problems to proven optimality. INFORMS J. Optim. 2(2), 134\u2013144 (2020). https:\/\/doi.org\/10.1287\/ijoo.2019.0027","journal-title":"INFORMS J. Optim."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.11.006","volume":"103","author":"C Contardo","year":"2019","unstructured":"Contardo, C., Iori, M., Kramer, R.: A scalable exact algorithm for the vertex $$p$$-center problem. Comput. Oper. Res. 103, 211\u2013220 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.11.006","journal-title":"Comput. Oper. Res."},{"key":"33_CR6","volume-title":"Network and Discrete Location: Models, Algorithms and Applications","author":"M Daskin","year":"2013","unstructured":"Daskin, M.: Network and Discrete Location: Models, Algorithms and Applications, 2nd edn. Taylor & Francis, Milton Park (2013)","edition":"2"},{"key":"33_CR7","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-1-4939-3094-4_19","volume-title":"Multiple Criteria Decision Analysis","author":"M Ehrgott","year":"2016","unstructured":"Ehrgott, M., Gandibleux, X., Przybylski, A.: Exact methods for multi-objective combinatorial optimisation. In: Greco, S., Ehrgott, M., Figueira, J.R. (eds.) Multiple Criteria Decision Analysis. ISORMS, vol. 233, pp. 817\u2013850. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-3094-4_19"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S Elloumi","year":"2004","unstructured":"Elloumi, S., Labb\u00e9, M., Pochet, Y.: A new formulation and resolution method for the p-center problem. INFORMS J. Comput. 16(1), 84\u201394 (2004). https:\/\/doi.org\/10.1287\/ijoc.1030.0028","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E.: The discrete $$p$$-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990). https:\/\/doi.org\/10.1016\/0377-2217(90)90297-O","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1287\/mnsc.23.10.1133","volume":"23","author":"RS Garfinkel","year":"1977","unstructured":"Garfinkel, R.S., Neebe, A.W., Rao, M.R.: The $$m$$-center problem: minimax facility location. Manage. Sci. 23(10), 1133\u20131142 (1977). https:\/\/doi.org\/10.1287\/mnsc.23.10.1133","journal-title":"Manage. Sci."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90224-5","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964). https:\/\/doi.org\/10.1287\/opre.12.3.450","journal-title":"Oper. Res."},{"doi-asserted-by":"publisher","unstructured":"D Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. Part I: the $$p$$-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979). https:\/\/doi.org\/10.1137\/0137040","key":"33_CR13","DOI":"10.1137\/0137040"},{"issue":"2","key":"33_CR14","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/ijoc.2019.0889","volume":"32","author":"R Kramer","year":"2020","unstructured":"Kramer, R., Iori, M., Vidal, T.: Mathematical models and search algorithms for the capacitated $$p$$-center problem. INFORMS J. Comput. 32(2), 444\u2013460 (2020). https:\/\/doi.org\/10.1287\/ijoc.2019.0889","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"MJ Kuby","year":"1987","unstructured":"Kuby, M.J.: Programming models for facility dispersion: the $$p$$-dispersion and maxisum dispersion problems. Geogr. Anal. 19(4), 315\u2013329 (1987). https:\/\/doi.org\/10.1111\/j.1538-4632.1987.tb00133.x","journal-title":"Geogr. Anal."},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/1012016","volume":"12","author":"E Minieka","year":"1970","unstructured":"Minieka, E.: The $$m$$-center problem. SIAM Rev. 12(1), 138\u2013139 (1970). https:\/\/doi.org\/10.1137\/1012016","journal-title":"SIAM Rev."},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42(2), 299\u2013310 (1994). https:\/\/doi.org\/10.1287\/opre.42.2.299","journal-title":"Oper. Res."},{"issue":"4","key":"33_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-A traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"issue":"1","key":"33_CR19","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2016.06.036","volume":"256","author":"D Sayah","year":"2017","unstructured":"Sayah, D., Irnich, S.: A new compact formulation for the discrete $$p$$-dispersion problem. Eur. J. Oper. Res. 256(1), 62\u201367 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.06.036","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2018.08.009","volume":"101","author":"GK Tutunchi","year":"2019","unstructured":"Tutunchi, G.K., Fathi, Y.: Effective methods for solving the bi-criteria $$p$$-center and $$p$$-dispersion problem. Comput. Oper. Res. 101, 43\u201354 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.08.009","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43612-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:33:23Z","timestamp":1693971203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43612-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436116","9783031436123"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43612-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccl2023.uni-hamburg.de\/en.html","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","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":"32","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":"0","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":"45% - 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":"2,42","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","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)"}}]}}