{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:05:31Z","timestamp":1742929531172,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030499877"},{"type":"electronic","value":"9783030499884"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-49988-4_22","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"315-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Boccia","sequence":"first","affiliation":[]},{"given":"Adriano","family":"Masone","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2545-5306","authenticated-orcid":false,"given":"Claudio","family":"Sterle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"issue":"6","key":"22_CR1","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1007\/s10958-009-9614-9","volume":"161","author":"A Agra","year":"2009","unstructured":"Agra, A., Cardoso, D.M., Cerdeira, J.O., Miranda, M., Rocha, E.: Solving huge size instances of the optimal diversity management problem. J. Math. Sci. 161(6), 956\u2013960 (2009)","journal-title":"J. Math. Sci."},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1111\/itor.12004","volume":"20","author":"A Agra","year":"2013","unstructured":"Agra, A., Cerdeira, J.O., Raquejo, C.: Using decomposition to improve greedy solutions of the optimal diversity management. Int. Trans. Oper. Res. 20(6), 617\u2013625 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cor.2017.05.006","volume":"86","author":"A Agra","year":"2017","unstructured":"Agra, A., Cerdeira, J.O., Requejo, C.: A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86, 79\u201385 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"22_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s10958-009-9612-y","volume":"161","author":"A Agra","year":"2009","unstructured":"Agra, A., Requejo, C.: The linking set problem: a polynomial special case of the multiple-choice knapsack problem. J. Math. Sci. 161(6), 919\u2013929 (2009)","journal-title":"J. Math. Sci."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-981-10-6147-9_1","volume-title":"Combinatorial Optimization and Graph Algorithms","author":"H-C An","year":"2017","unstructured":"An, H.-C., Svensson, O.: Recent developments in approximation algorithms for facility location and clustering problems. In: Fukunaga, T., Kawarabayashi, K. (eds.) Combinatorial Optimization and Graph Algorithms, pp. 1\u201319. Springer, Singapore (2017). \nhttps:\/\/doi.org\/10.1007\/978-981-10-6147-9_1"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10288-004-0059-1","volume":"3","author":"P Avella","year":"2005","unstructured":"Avella, P., Boccia, M., Martino, C.D., Oliviero, G., Sforza, A., Vasilyev, I.: A decomposition approach for a very large scale optimal diversity management problem. 4OR 3(1), 23\u201337 (2005). \nhttps:\/\/doi.org\/10.1007\/s10288-004-0059-1","journal-title":"4OR"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/opre.1040.0108","volume":"52","author":"O Briant","year":"2004","unstructured":"Briant, O., Naddef, D.: The optimal diversity management problem. Oper. Res. 52(4), 515\u2013526 (2004)","journal-title":"Oper. Res."},{"key":"22_CR8","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-67308-0_10","volume-title":"Optimization and Decision Science: Methodologies and Applications","author":"M Boccia","year":"2017","unstructured":"Boccia, M., Masone, A., Sforza, A., Sterle, C.: A partitioning based heuristic for a variant of the simple pattern minimality problem. In: Sforza, A., Sterle, C. (eds.) ODS 2017. SPMS, vol. 217, pp. 93\u2013102. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67308-0_10"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Boccia, M., Sforza, A., Sterle, C.: Simple pattern minimality problems: integer linear programming formulations and covering-based heuristic solving approaches. Informs J. Comput., 93\u2013102 (2020). \nhttps:\/\/doi.org\/10.1287\/ijoc.2019.0940\n\n. to appear","DOI":"10.1287\/ijoc.2019.0940"},{"issue":"7\u20139","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.tcs.2009.11.009","volume":"411","author":"Y Cheng","year":"2010","unstructured":"Cheng, Y., Kang, L., Lu, C.: The pos\/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411(7\u20139), 1038\u20131044 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location Science","author":"MS Daskin","year":"2015","unstructured":"Daskin, M.S., Maass, K.L.: The p-Median Problem. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 21\u201345. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13111-5_2"},{"key":"22_CR12","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2004","unstructured":"Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2004)"},{"issue":"3","key":"22_CR13","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)","journal-title":"Oper. Res."},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1002\/net.21821","volume":"74","author":"A Masone","year":"2019","unstructured":"Masone, A., Sterle, C., Vasilyev, I., Ushakov, A.: A three-stage p-median based exact method for the optimal diversity management problem. Networks 74(2), 174\u2013189 (2019)","journal-title":"Networks"},{"issue":"1","key":"22_CR15","first-page":"116","volume":"16","author":"A Masone","year":"2018","unstructured":"Masone, A., Sforza, A., Sterle, C., Vasiliev, I.: A graph clustering based decomposition approach for large scale p-median problems. Int. J. Artif. Intell. 16(1), 116\u2013129 (2018)","journal-title":"Int. J. Artif. Intell."},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovic","year":"2007","unstructured":"Mladenovic, N., Brimberg, J., Hansen, P., Moreno-P\u00e9rez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.20128","volume":"28","author":"J Reese","year":"2006","unstructured":"Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 28(3), 125\u2013142 (2006)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:04:27Z","timestamp":1593385467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","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":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","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":"102","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":"31","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":"30% - 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,5","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,5","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)"}}]}}