{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:31:35Z","timestamp":1743006695282,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030137083"},{"type":"electronic","value":"9783030137090"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-13709-0_20","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T18:09:04Z","timestamp":1550081344000},"page":"243-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improving Traditional Dual Ascent Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem: A RAMP Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","sequence":"first","affiliation":[]},{"given":"F\u00e1bio","family":"Maia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"65","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 65, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/S0377-2217(03)00072-9","volume":"155","author":"N Boland","year":"2004","unstructured":"Boland, N., et al.: Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3), 638\u2013653 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.cor.2006.07.002","volume":"35","author":"RS de Camargo","year":"2008","unstructured":"de Camargo, R.S., et al.: Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4), 1047\u20131064 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387\u2013405 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1016\/j.ejor.2005.08.028","volume":"179","author":"L C\u00e1novas","year":"2007","unstructured":"C\u00e1novas, L., et al.: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3), 990\u20131007 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"I Contreras","year":"2011","unstructured":"Contreras, I., et al.: Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6), 1477\u20131490 (2011)","journal-title":"Oper. Res."},{"issue":"6","key":"20_CR9","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992\u20131009 (1978)","journal-title":"Oper. Res."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86, 141\u2013159 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., et al.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"20_CR12","unstructured":"Fernandez, E.: Locating hubs: an overview of models and potential applications (2013)"},{"key":"20_CR13","unstructured":"Gamboa, D.: Adaptive memory algorithms for the solution of large scale combinatorial optimization problems. Ph.D. thesis (in Portuguese), Instituto Superior T\u00e9cnico, Universidade T\u00e9cnica de Lisboa (2008)"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2014part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0966-8349(96)00010-1","volume":"4","author":"JG Klincewicz","year":"1996","unstructured":"Klincewicz, J.G.: A dual algorithm for the uncapacitated hub location problem. Locat. Sci. 4(3), 173\u2013184 (1996)","journal-title":"Locat. Sci."},{"issue":"4","key":"20_CR17","first-page":"415","volume":"24","author":"J Kratica","year":"2005","unstructured":"Kratica, J., et al.: Genetic algorithm for solving uncapacitated multiple allocation hub location problem. Comput. Inform. 24(4), 415\u2013426 (2005)","journal-title":"Comput. Inform."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-62395-5_48","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2017","author":"T Matos","year":"2017","unstructured":"Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation hub location problem. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10405, pp. 696\u2013708. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62395-5_48"},{"issue":"6","key":"20_CR19","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/S0305-0548(01)00080-6","volume":"29","author":"G Mayer","year":"2002","unstructured":"Mayer, G., Wagner, B.: HubLocator: an exact solution method for the multiple allocation hub location problem. Comput. Oper. Res. 29(6), 715\u2013739 (2002)","journal-title":"Comput. Oper. Res."},{"key":"20_CR20","unstructured":"Mokhtar, H., et al.: A new Benders decomposition acceleration procedure for large scale multiple allocation hub location problems. In: International Congress on Modelling and Simulation, pp. 340\u2013346 (2017)"},{"issue":"3","key":"20_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393\u2013404 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search","author":"C Rego","year":"2005","unstructured":"Rego, C.: RAMP: a new metaheuristic framework for combinatorial optimization. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 441\u2013460. Kluwer Academic Publishers, Boston (2005)"},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10479-010-0800-4","volume":"181","author":"C Rego","year":"2010","unstructured":"Rego, C., et al.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181(1), 661\u2013681 (2010)","journal-title":"Ann. Oper. Res."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Riley, C., et al.: A simple dual-RAMP algorithm for resource constraint project scheduling. In: Proceedings of the 48th Annual Southeast Regional Conference on - ACM SE 2010, p. 1 ACM Press, New York (2010)","DOI":"10.1145\/1900008.1900097"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13709-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:58:07Z","timestamp":1709823487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-13709-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030137083","9783030137090"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13709-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2018.icas.xyz\/","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, in-house system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","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":"46","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":"37% - 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":"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":"1.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)"}}]}}