{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:24Z","timestamp":1774449084985,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","award":["UIDB\/04728\/2020"],"award-info":[{"award-number":["UIDB\/04728\/2020"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10472-021-09756-0","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T22:02:24Z","timestamp":1624312944000},"page":"815-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A dual RAMP algorithm for single source capacitated facility location problems"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3807-7292","authenticated-orcid":false,"given":"\u00d3scar","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","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":[[2021,6,21]]},"reference":[{"key":"9756_CR1","doi-asserted-by":"publisher","unstructured":"Farahani, R., Hekmatfar, M.: Facility location: concepts, models, algorithms and case studies. Physica-Verlag. (2009). https:\/\/doi.org\/10.1007\/978-3-7908-2151-2","DOI":"10.1007\/978-3-7908-2151-2"},{"key":"9756_CR2","doi-asserted-by":"publisher","unstructured":"Rego, C.: RAMP: a new metaheuristic framework for combinatorial optimization. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution, pp. 441\u2013460. Kluwer Academic Publishers (2005). https:\/\/doi.org\/10.1007\/0-387-23667-8_20","DOI":"10.1007\/0-387-23667-8_20"},{"key":"9756_CR3","doi-asserted-by":"publisher","unstructured":"Riley, C., Rego, C., Li, H.: A simple dual-RAMP algorithm for resource constraint project scheduling. In: Proceedings of the 48th Annual Southeast Regional Conference on - ACM SE \u201810. p. 1. ACM Press, New York, New York, USA (2010). https:\/\/doi.org\/10.1145\/1900008.1900097","DOI":"10.1145\/1900008.1900097"},{"key":"9756_CR4","unstructured":"Gamboa, D.: Adaptive Memory Algorithms for the Solution of Large Scale Combinatorial Optimization Problems, PhD Thesis (in Portuguese), Instituto Superior T\u00e9cnico, Universidade T\u00e9cnica de Lisboa, (2008)"},{"key":"9756_CR5","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10479-010-0800-4","volume":"181","author":"C Rego","year":"2010","unstructured":"Rego, C., Mathew, F., Glover, F.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181, 661\u2013681 (2010). https:\/\/doi.org\/10.1007\/s10479-010-0800-4","journal-title":"Ann. Oper. Res."},{"key":"9756_CR6","doi-asserted-by":"publisher","unstructured":"Matos, T., Gamboa, D.: Dual-RAMP for the Capacitated Single Allocation Hub Location Problem. In: Gervasi, O., Murgante, B., Misra, S., Borruso, G., Torre, C.M., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O., Stankova, E., and Cuzzocrea, A. (eds.) Computational Science and Its Applications -- ICCSA 2017: 17th International Conference, Trieste, Italy, July 3\u20136, 2017, Proceedings, Part II. pp. 696\u2013708. Springer International Publishing (2017). https:\/\/doi.org\/10.1007\/978-3-319-62395-5_48","DOI":"10.1007\/978-3-319-62395-5_48"},{"key":"9756_CR7","doi-asserted-by":"publisher","unstructured":"Matos, T., Maia, F., Gamboa, D.: Improving Traditional Dual Ascent Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem: A RAMP Approach. In: The Fourth International Conference on Machine Learning, Optimization, and Data Science \u2013 September 13\u201316, 2018 \u2013 Volterra, Tuscany, Italy. pp. 243\u2013253. Springer, Italy (2019). https:\/\/doi.org\/10.1007\/978-3-030-13709-0_20","DOI":"10.1007\/978-3-030-13709-0_20"},{"key":"9756_CR8","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, 190\u2013206 (1989). https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"ORSA J. Comput"},{"key":"9756_CR9","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. Tabu Search\u2014Part II. ORSA J. Comput. 2, 4\u201332 (1990). https:\/\/doi.org\/10.1287\/ijoc.2.1.4","journal-title":"Tabu Search\u2014Part II. ORSA J. Comput."},{"key":"9756_CR10","doi-asserted-by":"publisher","unstructured":"Oliveira, \u00d3., Matos, T., Gamboa, D.: A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems. In: Matsatsinis, N.F., Marinakis, Y., and Pardalos, P. (eds.) Learning and Intelligent Optimization. LION 2019. pp. 171\u2013183 (2020). https:\/\/doi.org\/10.1007\/978-3-030-38629-0_14","DOI":"10.1007\/978-3-030-38629-0_14"},{"key":"9756_CR11","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979). https:\/\/doi.org\/10.2307\/2273574, Michael R. \u03a0Garey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp","DOI":"10.2307\/2273574"},{"key":"9756_CR12","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1057\/jors.1983.242","volume":"34","author":"AW Neebe","year":"1983","unstructured":"Neebe, A.W., Rao, M.R.: An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34, 1107\u20131113 (1983). https:\/\/doi.org\/10.1057\/jors.1983.242","journal-title":"J. Oper. Res. Soc."},{"key":"9756_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J Barcel\u00f3","year":"1984","unstructured":"Barcel\u00f3, J., Casanovas, J.: A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15, 212\u2013226 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"JG Klincewicz","year":"1986","unstructured":"Klincewicz, J.G., Luss, H.: A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37, 495\u2013500 (1986). https:\/\/doi.org\/10.1057\/jors.1986.84","journal-title":"J. Oper. Res. Soc."},{"key":"9756_CR15","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, 992\u20131009 (1978). https:\/\/doi.org\/10.1287\/opre.26.6.992","journal-title":"Oper. Res."},{"key":"9756_CR16","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1057\/jors.1991.117","volume":"66","author":"R Sridharan","year":"1991","unstructured":"Sridharan, R.: A Lagrangian heuristic for the capacitated plant location problem with side constraints. J. Oper. Res. Soc. 66, 579\u2013585 (1991). https:\/\/doi.org\/10.1057\/jors.1991.117","journal-title":"J. Oper. Res. Soc."},{"key":"9756_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H Pirkul","year":"1987","unstructured":"Pirkul, H.: Efficient algorithms for the capacitated concentrator location problem. Comput. Oper. Res. 14, 197\u2013208 (1987). https:\/\/doi.org\/10.1016\/0305-0548(87)90022-0","journal-title":"Comput. Oper. Res"},{"key":"9756_CR18","doi-asserted-by":"publisher","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383\u2013399 (1993). https:\/\/doi.org\/10.1016\/0377-2217(93)90118-7","DOI":"10.1016\/0377-2217(93)90118-7"},{"key":"9756_CR19","first-page":"217","volume":"8","author":"H Delmaire","year":"1997","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., Ortega, M.: Comparing new heuristics for the pure integer capacitated plant location problem. Investig. Oper. 8, 217\u2013242 (1997)","journal-title":"Investig. Oper."},{"key":"9756_CR20","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/03155986.1999.11732381","volume":"37","author":"H Delmaire","year":"1999","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., Ortega, M.: Reactive Grasp and Tabu search based heuristics for the single source capacitated plant location problem. INFOR Inf. Syst. Oper. Res. 37, 194\u2013225 (1999). https:\/\/doi.org\/10.1080\/03155986.1999.11732381","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"9756_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","volume":"116","author":"M R\u00f6nnqvist","year":"1999","unstructured":"R\u00f6nnqvist, M., Tragantalerngsak, S., Holt, J.: A repeated matching heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 116, 51\u201368 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00045-9","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR22","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg, K., R\u00f6nnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113, 544\u2013559 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00008-3","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR23","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1057\/palgrave.jors.2600698","volume":"50","author":"KS Hindi","year":"1999","unstructured":"Hindi, K.S., Pie\u0144kosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50, 268\u2013274 (1999). https:\/\/doi.org\/10.1057\/palgrave.jors.2600698","journal-title":"J. Oper. Res. Soc."},{"key":"9756_CR24","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"RK Ahuja","year":"2004","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutell\u00e0, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manag. Sci. 50, 749\u2013760 (2004). https:\/\/doi.org\/10.1287\/mnsc.1030.0193","journal-title":"Manag. Sci."},{"key":"9756_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(02)00829-9","volume":"151","author":"MJ Cortinhal","year":"2003","unstructured":"Cortinhal, M.J., Captivo, M.E.: Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. 151, 333\u2013351 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00829-9","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","volume":"157","author":"IA Contreras","year":"2007","unstructured":"Contreras, I.A., D\u00edaz, J.A.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157, 73\u201389 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0193-1","journal-title":"Ann. Oper. Res"},{"key":"9756_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-0337-8","volume":"24","author":"M Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R., Marti, R.: Scatter search. Oper. Res. Comput. Sci. Interfaces Ser. 24, 1\u2013283 (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0337-8","journal-title":"Oper. Res. Comput. Sci. Interfaces Ser"},{"key":"9756_CR28","first-page":"28","volume":"12","author":"K Kumweang","year":"2005","unstructured":"Kumweang, K., Kawtummachai, R.: Solving a SSCFLP in a supply chain with ACO. Suranaree J. Sci. 12, 28\u201338 (2005)","journal-title":"Suranaree J. Sci."},{"key":"9756_CR29","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/11839088_55","volume":"44","author":"C-H Chen","year":"2008","unstructured":"Chen, C.-H., Ting, C.-J.: Combining Lagrangian heuristic and ant Colony system to solve the single source capacitated facility location problem. Transp. Res. Part E Logist. Transp. Rev. 44, 1099\u20131122 (2008). https:\/\/doi.org\/10.1007\/11839088_55","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"9756_CR30","doi-asserted-by":"publisher","unstructured":"Lina, Y., Xu, S., Tianhe, C.: A Hybrid Ant Colony Optimization Algorithm with Local Search Strategies to Solve Single Source Capacitated Facility Location Problem. In: 2012 International Conference on Industrial Control and Electronics Engineering. pp. 83\u201385. IEEE (2012). https:\/\/doi.org\/10.1109\/ICICEE.2012.30","DOI":"10.1109\/ICICEE.2012.30"},{"key":"9756_CR31","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","volume":"221","author":"Z Yang","year":"2012","unstructured":"Yang, Z., Chu, F., Chen, H.: A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur. J. Oper. Res. 221, 521\u2013532 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.03.047","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR32","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.artint.2006.02.005","volume":"170","author":"S Climer","year":"2006","unstructured":"Climer, S., Zhang, W.: Cut-and-solve: an iterative search strategy for combinatorial optimization problems. Artif. Intell. 170, 714\u2013738 (2006). https:\/\/doi.org\/10.1016\/j.artint.2006.02.005","journal-title":"Artif. Intell."},{"key":"9756_CR33","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2014.11.004","volume":"27","author":"SC Ho","year":"2015","unstructured":"Ho, S.C.: An iterated tabu search heuristic for the single source capacitated facility location problem. Appl. Soft Comput. 27, 169\u2013178 (2015). https:\/\/doi.org\/10.1016\/j.asoc.2014.11.004","journal-title":"Appl. Soft Comput."},{"key":"9756_CR34","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","volume":"238","author":"G Guastaroba","year":"2014","unstructured":"Guastaroba, G., Speranza, M.G.: A heuristic for BILP problems: the single source capacitated facility location problem. Eur. J. Oper. Res. 238, 438\u2013450 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.04.007","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ejor.2017.04.032","volume":"263","author":"TH Tran","year":"2017","unstructured":"Tran, T.H., Scaparra, M.P., O\u2019Hanley, J.R.: A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 263, 173\u2013187 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.04.032","journal-title":"Eur. J. Oper. Res."},{"key":"9756_CR36","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manag. Sci. 45, 414\u2013425 (1999). https:\/\/doi.org\/10.1287\/mnsc.45.3.414","journal-title":"Manag. Sci."},{"key":"9756_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-007-9125-x","volume":"43","author":"P Avella","year":"2009","unstructured":"Avella, P., Boccia, M.: A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43, 39\u201365 (2009). https:\/\/doi.org\/10.1007\/s10589-007-9125-x","journal-title":"Comput. Optim. Appl."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09756-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09756-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09756-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T16:31:10Z","timestamp":1631809870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09756-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":37,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["9756"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09756-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"3 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}