{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:29:07Z","timestamp":1750094947175},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T00:00:00Z","timestamp":1518998400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-018-2796-0","type":"journal-article","created":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T01:46:04Z","timestamp":1519004764000},"page":"33-54","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient approaches for the Flooding Problem on graphs"],"prefix":"10.1007","volume":"286","author":[{"given":"Andr\u00e9 Renato Villela","family":"da Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno Jos\u00e9 da Silva","family":"Barros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian Gabriel S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,19]]},"reference":[{"key":"2796_CR1","unstructured":"Adriaen, M., De Causmaecker, P., Demeester, P., & Vanden Berghe, G. (2004). Spatial simulation model for infectious viral disease with focus on SARS and the common flu. In 37th annual Hawaii international conference on system sciences. IEEE Computer Society. ISBN: 0-7695-2056-1."},{"key":"2796_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"RM Aiex","year":"2002","unstructured":"Aiex, R. M., Resende, M. G. C., & Ribeiro, C. C. (2002). Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 8, 343\u2013373.","journal-title":"Journal of Heuristics"},{"key":"2796_CR3","doi-asserted-by":"crossref","unstructured":"Barone, P., Bonizzoni, P., Vedova, G. D., & Mauri, G. (2001). An approximation algorithm for the shortest common supersequence problem: An experimental analysis. In ACM symposium on applied computing (pp. 56\u201360).","DOI":"10.1145\/372202.372275"},{"key":"2796_CR4","unstructured":"Barros, B. J. S., Pinheiro, R. G. S., & Souza, U. S. (2015). M\u00e9todos heur\u00edsticos e exatos para o Problema de Inunda\u00e7\u00e3o em Grafos. In Anais do XLVII Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO2015), Salvador\/Brasil."},{"key":"2796_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00224-011-9339-2","volume":"50","author":"R Clifford","year":"2012","unstructured":"Clifford, R., Jalsenius, M., Montanaro, A., & Sach, B. (2012). The complexity of flood filling game. Theory of Computing Systems, 50, 72\u201392. https:\/\/doi.org\/10.1007\/s00224-011-9339-2 .","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"2796_CR6","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10479-015-2091-2","volume":"258","author":"Ivan Contreras","year":"2016","unstructured":"Contreras, I., Tanash, M., & Vidyarthi, N. (2016). Exact and heuristic approaches for the cycle hub location problem. Annals of Operations Research, 1\u201323. https:\/\/doi.org\/10.1007\/s10479-015-2091-2 .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2796_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10479-014-1685-4","volume":"239","author":"GHG Fonseca da","year":"2016","unstructured":"da Fonseca, G. H. G., Santos, H. G., Toffolo, T. A. M., Brito, S. S., & Souza, M. J. F. (2016). GOAL solver: A hybrid local search based solver for high school timetabling. Annals of Operations Research, 239(1), 77\u201397. https:\/\/doi.org\/10.1007\/s10479-014-1685-4 .","journal-title":"Annals of Operations Research"},{"key":"2796_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1590\/S0101-74382007000300004","volume":"27","author":"CTL Silva da","year":"2007","unstructured":"da Silva, C. T. L., Arenales, M. N., & Silveira, R. (2007). M\u00e9todos tipo dual simplex para problemas de otimiza\u00e7\u00e3o linear canalizados e esparsos. Pesquisa Operacional, 27, 457\u2013486. https:\/\/doi.org\/10.1590\/S0101-74382007000300004 .","journal-title":"Pesquisa Operacional"},{"key":"2796_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S0962492916000076","volume":"25","author":"T Davis","year":"2016","unstructured":"Davis, T., Rajamanickam, S., & Sid-Lakhdar, W. (2016). A survey of direct methods for sparse linear systems. Acta Numerica, 25, 383\u2013566. https:\/\/doi.org\/10.1017\/S0962492916000076 .","journal-title":"Acta Numerica"},{"key":"2796_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"2796_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and surveys on metaheuristics","author":"P Festa","year":"2002","unstructured":"Festa, P., & Resende, M. G. C. (2002). GRASP: An annotated bibliography. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys on metaheuristics (pp. 325\u2013367). Boston: Kluwer Academic Publishers."},{"key":"2796_CR12","unstructured":"Fleischer, R., & Woeginger, G. J. (2010). An algorithmic analysis of the Honey-Bee game. In P. Boldi, & L. Gargano (Eds.), FUN. Lecture notes in computer science (Vol. 6099, pp. 178-189). Berlin: Springer. ISBN: 978-3-642-13121-9."},{"key":"2796_CR13","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Boston, MA: Addison-Wesley Longman Publishing Co. Inc."},{"key":"2796_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1111\/itor.12109","volume":"23","author":"JF Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, J. F., Resende, M. G. C., & Costa, M. D. (2016). A biased random-key genetic algorithm for the minimization of open stacks problem. International Transactions in Operational Research, 23, 25\u201346.","journal-title":"International Transactions in Operational Research"},{"key":"2796_CR15","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"2796_CR16","unstructured":"LabPixies. (2015). Labpixies\u2014The coolest games! Avaiable at http:\/\/www.labpixies.com . Access on 04\/27\/2015."},{"key":"2796_CR17","unstructured":"Lagoutte, A., & Tavenas, S. (2013). The complexity of shortest common supersequence for inputs with no identical consecutive letters. arXiv:1309.0422 [cs.DM]."},{"issue":"2","key":"2796_CR18","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.dam.2013.09.024","volume":"164","author":"A Lagoutte","year":"2014","unstructured":"Lagoutte, A., Noual, M., & Thierry, E. (2014). Flooding games on graphs. Discrete Applied Mathematics, 164(2), 532\u2013538.","journal-title":"Discrete Applied Mathematics"},{"key":"2796_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L. P., St\u00fctzle, T., & Birattari, M. (2016). The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3, 43\u201358.","journal-title":"Operations Research Perspectives"},{"key":"2796_CR20","first-page":"321","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & Stutzle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321\u2013353). Norwell: Kluwer Academic Publishers."},{"key":"2796_CR21","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.dam.2011.09.001","volume":"160","author":"K Meeks","year":"2011","unstructured":"Meeks, K., & Scott, A. (2011). The complexity of flood-filling games on graphs. Discrete Applied Mathematics, 160, 959\u2013969. https:\/\/doi.org\/10.1016\/j.dam.2011.09.001 .","journal-title":"Discrete Applied Mathematics"},{"key":"2796_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2013.06.010","volume":"500","author":"K Meeks","year":"2013","unstructured":"Meeks, K., & Scott, A. (2013). The complexity of free-flood-it on $$2\\times n$$ 2 \u00d7 n boards. Theoretical Computer Science, 500, 25\u201343. https:\/\/doi.org\/10.1016\/j.tcs.2013.06.010 .","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2796_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P. H. V., Subramanian, A., & Ochi, L. S. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19(2), 201\u2013232. https:\/\/doi.org\/10.1007\/s10732-011-9186-y .","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2796_CR24","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/bioinformatics\/btg1073","volume":"19","author":"S Rahmann","year":"2003","unstructured":"Rahmann, S. (2003). The shortest common supersequence problem in a microarray production setting. Bioinformatics, 19(2), 156\u2013161.","journal-title":"Bioinformatics"},{"issue":"Supplement C","key":"2796_CR25","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"Sabar, N. R., & Kendall, G. (2015). An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega, 56(Supplement C), 88\u201398. https:\/\/doi.org\/10.1016\/j.omega.2015.03.007 .","journal-title":"Omega"},{"key":"2796_CR26","doi-asserted-by":"publisher","unstructured":"Silva, A. R. V., & Ochi, L. S. (2010). Hybrid heuristics for dynamic resource-constrained project scheduling problem. In Hybrid metaheuristics: 7th international workshop, HM 2010, Vienna, Austria (pp. 73\u201387). https:\/\/doi.org\/10.1007\/978-3-642-16054-7-6 .","DOI":"10.1007\/978-3-642-16054-7-6"},{"key":"2796_CR27","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.eswa.2016.07.038","volume":"64","author":"ARV Silva","year":"2016","unstructured":"Silva, A. R. V., & Ochi, L. S. (2016). An efficient hybrid algorithm for the traveling car renter problem. Expert Systems with Applications, 64, 132\u2013140. https:\/\/doi.org\/10.1016\/j.eswa.2016.07.038 .","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"2796_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S1570-8667(03)00011-X","volume":"1","author":"J Sim","year":"2003","unstructured":"Sim, J., & Park, K. (2003). The consensus string problem for a metric is NP-complete. Journal of Discrete Algorithms, 1(1), 111\u2013117.","journal-title":"Journal of Discrete Algorithms"},{"key":"2796_CR29","first-page":"279","volume":"16","author":"US Souza","year":"2014","unstructured":"Souza, U. S., Protti, F., & Dantas da Silva, M. (2014). An algorithmic analysis of flood-it and free-flood-it on graph powers. Discrete Mathematics and Theoretical Computer Science, 16, 279\u2013290.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"2796_CR30","unstructured":"Souza, U. S., Protti, F., & Silva, M. D. (2013). Parameterized complexity of flood-filling games on trees. In D. Z. Du & G. Zhang (Eds.), Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science (Vol. 7936). Berlin: Springer. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-38768-5_47 ."},{"issue":"1","key":"2796_CR31","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-015-1800-1","volume":"249","author":"F Stefanello","year":"2017","unstructured":"Stefanello, F., Buriol, L. S., Hirsch, M. J., Pardalos, P. M., Querido, T., Resende, M. G. C., et al. (2017). On the minimization of traffic congestion in road networks with tolls. Annals of Operations Research, 249(1), 119\u2013139. https:\/\/doi.org\/10.1007\/s10479-015-1800-1 .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2796_CR32","doi-asserted-by":"publisher","first-page":"4010","DOI":"10.1016\/j.eswa.2013.01.008","volume":"40","author":"I Yevseyeva","year":"2013","unstructured":"Yevseyeva, I., Basto-Fernandes, V., Ruano-Ord\u00e1s, D., & M\u00e9endez, J. R. (2013). Optimising anti-spam filters with evolutionary algorithms. Expert Systems with Applications, 40(1), 4010\u20134021. https:\/\/doi.org\/10.1016\/j.eswa.2013.01.008 .","journal-title":"Expert Systems with Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2796-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T02:50:04Z","timestamp":1693536604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2796-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,19]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2796"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2796-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,19]]},"assertion":[{"value":"19 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}