{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T01:44:36Z","timestamp":1774921476237,"version":"3.50.1"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031265037","type":"print"},{"value":"9783031265044","type":"electronic"}],"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-26504-4_37","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"485-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Fixed Set Search for\u00a0the\u00a0Covering Location with\u00a0Interconnected Facilities Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2608-8464","authenticated-orcid":false,"given":"Isaac","family":"Lozano-Osorio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9995-010X","authenticated-orcid":false,"given":"Anna","family":"Mart\u00ednez-Gavara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3022-3865","authenticated-orcid":false,"given":"Ana D.","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski, M.L.: Integer programming: methods, uses, computations. Manag. Sci. 12(3), 253\u2013313 (1965)","journal-title":"Manag. Sci."},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2019.03.002","volume":"107","author":"M Cherkesly","year":"2019","unstructured":"Cherkesly, M., Landete, M., Laporte, G.: Median and covering location problems with interconnected facilities. Comput. Oper. Res. 107, 1\u201318 (2019)","journal-title":"Comput. Oper. Res."},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-05983-5_5","volume-title":"Hybrid Metaheuristics","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume-title":"Analysis of Experimental Algorithms","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 490\u2013504. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34029-2_31"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"107521","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl. Soft Comput. 110, 107521 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"37_CR6","first-page":"629","volume":"33","author":"AD L\u00f3pez-S\u00e1nchez","year":"2020","unstructured":"L\u00f3pez-S\u00e1nchez, A.D., S\u00e1nchez-Oro, J., Laguna, M.: A new scatter search design for multiobjective combinatorial optimization with an application to facility location. INFORMS J. Comput. 33(2), 629\u2013642 (2020)","journal-title":"INFORMS J. Comput."},{"key":"37_CR7","unstructured":"Mart\u00edn, R., Cavero, S.: rmartinsanta\/mork: v0.11 (2022)"},{"issue":"1","key":"37_CR8","first-page":"1","volume":"22","author":"NN Srinidhi","year":"2019","unstructured":"Srinidhi, N.N., Kumar, S.M.D., Venugopal, K.R.: Network optimizations in the internet of things: a review. Eng. Sci. Technol. Int. J. 22(1), 1\u201321 (2019)","journal-title":"Eng. Sci. Technol. Int. J."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:35Z","timestamp":1688198735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","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":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"48","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":"17","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":"67% - 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":"3","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)"}}]}}