{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:07Z","timestamp":1740107827877,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00500-022-07602-x","type":"journal-article","created":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T12:02:53Z","timestamp":1668340973000},"page":"4699-4712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using adaptive memory in GRASP to find minimum conflict-free spanning trees"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5292-9589","authenticated-orcid":false,"given":"Bruno Jos\u00e9","family":"da Silva Barros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian Gabriel S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,13]]},"reference":[{"issue":"4","key":"7602_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex RM, Resende MGC, Ribeiro CC (2007) Ttt plots: a Perl program to create time-to-target plots. Optim Lett 1(4):355\u2013366. https:\/\/doi.org\/10.1007\/s11590-006-0031-4","journal-title":"Optim Lett"},{"key":"7602_CR2","unstructured":"Barbosa MAL, Delbem ACB (2017) A iterated local search for the minimum spanning tree under conflict constraints (published in portuguese). In: Annals of XLVIII Brazilian symposium of operational research (Anais do XLIII Simp\u00f3sio Brasileiro de Pesquisa Operacional), pp 2533\u20132544"},{"key":"7602_CR3","doi-asserted-by":"publisher","unstructured":"Binato S, Hery WJ, Loewenstern DM, Resende MG (2000) A grasp for job shop scheduling. Essays Surv Metaheur. https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_3","DOI":"10.1007\/978-1-4615-1507-4_3"},{"key":"7602_CR4","unstructured":"Bittencourt YB, Camp\u00ealo M, Dias FCS (2016) Mtz formulation for minimum spanning tree under conflict constraints (published in portuguese). In: Annals of XLIII Brazilian symposium of operational research (Anais do XLVIII Simp\u00f3sio Brasileiro de Pesquisa Operacional), pp 2441\u20132448"},{"key":"7602_CR5","unstructured":"Bresina JL (1996) Heuristic-biased stochastic sampling. In: Clancey WJ, Weld DS (eds) Proceedings of the 13th national conference on artificial intelligence and 8th innovative applications of artificial intelligence conference, AAAI 96, IAAI 96, Portland, Oregon, USA, August 4\u20138, vol\u00a01. AAAI Press\/The MIT Press, pp 271\u2013278"},{"issue":"4","key":"7602_CR6","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10732-018-9372-2","volume":"24","author":"R Capua","year":"2018","unstructured":"Capua R, Frota Y, Ochi LS, Vidal T (2018) A study on exponential-size neighborhoods for the bin packing problem with conflicts. J Heurist 24(4):667\u2013695. https:\/\/doi.org\/10.1007\/s10732-018-9372-2","journal-title":"J Heurist"},{"key":"7602_CR7","doi-asserted-by":"publisher","unstructured":"Carrabs F, Gaudioso M (2020) A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. Networks. https:\/\/doi.org\/10.1002\/net.22009","DOI":"10.1002\/net.22009"},{"issue":"3","key":"7602_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11590-017-1161-6","volume":"12","author":"F Carrabs","year":"2018","unstructured":"Carrabs F, Cerrone C, Cerulli R, Silvestri S (2018) On the complexity of rainbow spanning forest problem. Optim Lett 12(3):443\u2013454. https:\/\/doi.org\/10.1007\/s11590-017-1161-6","journal-title":"Optim Lett"},{"issue":"8","key":"7602_CR9","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1007\/s00500-017-2540-8","volume":"22","author":"F Carrabs","year":"2018","unstructured":"Carrabs F, Cerrone C, Cerulli R, Silvestri S (2018) The rainbow spanning forest problem. Soft Comput 22(8):2765\u20132776. https:\/\/doi.org\/10.1007\/s00500-017-2540-8","journal-title":"Soft Comput"},{"key":"7602_CR10","doi-asserted-by":"crossref","unstructured":"Carrabs F, Cerulli R, Pentangelo R et al (2021) Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann Oper Res 298:65\u201378. https:\/\/doi.org\/10.1007\/s10479-018-2895-y","DOI":"10.1007\/s10479-018-2895-y"},{"issue":"2","key":"7602_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1002\/net.21883","volume":"74","author":"F Carrabs","year":"2019","unstructured":"Carrabs F, Cerrone C, Pentangelo R (2019) A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. Networks 74(2):134\u2013147. https:\/\/doi.org\/10.1002\/net.21883","journal-title":"Networks"},{"key":"7602_CR12","doi-asserted-by":"publisher","unstructured":"Cerrone C, Di\u00a0Placido A, Russo DD (2019) A genetic algorithm for minimum conflict weighted spanning tree problem. In: Advances in optimization and decision science for society, services and enterprises, vol\u00a03. Springer, pp 445\u2013455. https:\/\/doi.org\/10.1007\/978-3-030-34960-8_39","DOI":"10.1007\/978-3-030-34960-8_39"},{"key":"7602_CR13","doi-asserted-by":"publisher","unstructured":"Cerulli R, D\u2019Ambrosio C, Raiconi A, Vitale G (2020) The knapsack problem with forfeits. In: Ba\u00efou M, Gendron B, G\u00fcnl\u00fck O, Mahjoub AR (eds) Combinatorial optimization\u20146th international symposium, ISCO 2020, Montreal, QC, Canada, May 4\u20136, 2020, Revised selected papers, Lecture notes in computer science, vol 12176. Springer, pp 263\u2013272. https:\/\/doi.org\/10.1007\/978-3-030-53262-8_22","DOI":"10.1007\/978-3-030-53262-8_22"},{"key":"7602_CR14","doi-asserted-by":"publisher","unstructured":"Darmann A, Pferschy U, Schauer J (2009) Determining a minimum spanning tree with disjunctive constraints. In: Rossi F, Tsouki\u00e0s A (eds) Algorithmic decision theory, 1st international conference, ADT 2009, Venice, Italy, October 20\u201323, 2009. Proceedings, Lecture notes in computer science, vol 5783. Springer, pp 414\u2013423. https:\/\/doi.org\/10.1007\/978-3-642-04428-1_36","DOI":"10.1007\/978-3-642-04428-1_36"},{"issue":"16","key":"7602_CR15","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann A, Pferschy U, Schauer J, Woeginger GJ (2011) Paths, trees and matchings under disjunctive constraints. Discret Appl Math 159(16):1726\u20131735. https:\/\/doi.org\/10.1016\/j.dam.2010.12.016","journal-title":"Discret Appl Math"},{"key":"7602_CR16","doi-asserted-by":"publisher","unstructured":"Exp\u00f3sito A, Brito J, Moreno-P\u00e9rez JA (2016) A heuristic-biased GRASP for the team orienteering problem. In: Luaces O, G\u00e1mez JA, Barrenechea E, Troncoso A, Galar M, Quinti\u00e1n H, Corchado E (eds) Advances in artificial intelligence\u201417th conference of the Spanish association for artificial intelligence, CAEPIA 2016, Salamanca, Spain, September 14\u201316, 2016. Proceedings, Lecture notes in computer science, vol 9868. Springer, pp 428\u2013437. https:\/\/doi.org\/10.1007\/978-3-319-44636-3_40","DOI":"10.1007\/978-3-319-44636-3_40"},{"issue":"2","key":"7602_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133. https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J Glob Optim"},{"issue":"5","key":"7602_CR18","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo TA, Resende MGC, Smith SH (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42(5):860\u2013878. https:\/\/doi.org\/10.1287\/opre.42.5.860","journal-title":"Oper Res"},{"issue":"3","key":"7602_CR19","doi-asserted-by":"publisher","first-page":"3526","DOI":"10.1016\/j.eswa.2011.09.043","volume":"39","author":"CS Ferreira","year":"2012","unstructured":"Ferreira CS, Ochi LS, Parada V, Uchoa E (2012) A GRASP-based approach to the generalized minimum spanning tree problem. Expert Syst Appl 39(3):3526\u20133536. https:\/\/doi.org\/10.1016\/j.eswa.2011.09.043","journal-title":"Expert Syst Appl"},{"key":"7602_CR20","doi-asserted-by":"publisher","unstructured":"Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. Informs J Comput 11(2):198\u2013204. https:\/\/doi.org\/10.1287\/ijoc.11.2.198","DOI":"10.1287\/ijoc.11.2.198"},{"issue":"3","key":"7602_CR21","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M Gendreau","year":"2004","unstructured":"Gendreau M, Laporte G, Semet F (2004) Heuristics and lower bounds for the bin packing problem with conflicts. Comput Oper Res 31(3):347\u2013358. https:\/\/doi.org\/10.1016\/S0305-0548(02)00195-8","journal-title":"Comput Oper Res"},{"key":"7602_CR22","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves LB, Ochi LS, Martins SL (2005) A GRASP with adaptive memory for a period vehicle routing problem. In: 2005 international conference on computational intelligence for modelling control and automation (CIMCA 2005), international conference on intelligent agents, web technologies and internet commerce (IAWTIC 2005), 28\u201330 November 2005, Vienna, Austria. IEEE Computer Society, pp 721\u2013727. https:\/\/doi.org\/10.1109\/CIMCA.2005.1631349","DOI":"10.1109\/CIMCA.2005.1631349"},{"key":"7602_CR23","doi-asserted-by":"publisher","unstructured":"Gouveia T, Queiroga E, Ochi LS, dos Anjos Formiga Cabral L, Gueye S, Michelon P (2019) A hybrid metaheuristic for the minimum labeling spanning tree problem. Eur J Oper Res 274(1):22\u201334. https:\/\/doi.org\/10.1016\/j.ejor.2018.09.044","DOI":"10.1016\/j.ejor.2018.09.044"},{"key":"7602_CR24","doi-asserted-by":"crossref","unstructured":"Hollander M, Wolfe DA, Chicken E (2014) Nonparametric statistical methods. Wiley","DOI":"10.1002\/9781119196037"},{"issue":"1","key":"7602_CR25","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350. https:\/\/doi.org\/10.2307\/2033241","journal-title":"Proc Am Math Soc"},{"issue":"4","key":"7602_CR26","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J ACM"},{"issue":"2","key":"7602_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy U, Schauer J (2009) The knapsack problem with conflict graphs. J Graph Algorithms Appl 13(2):233\u2013249. https:\/\/doi.org\/10.7155\/jgaa.00186","journal-title":"J Graph Algorithms Appl"},{"issue":"6","key":"7602_CR28","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36(6):1389\u20131401. https:\/\/doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"Bell Syst Tech J"},{"key":"7602_CR29","doi-asserted-by":"publisher","unstructured":"Resende MG, Ribeiro CC (2016) Optimization by GRASP: greedy randomized adaptive search procedures, 1st edn. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4939-6530-4","DOI":"10.1007\/978-1-4939-6530-4"},{"issue":"1","key":"7602_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11590-014-0750-x","volume":"9","author":"P Samer","year":"2015","unstructured":"Samer P, Urrutia S (2015) A branch and cut algorithm for minimum spanning trees under conflict constraints. Optim Lett 9(1):41\u201355. https:\/\/doi.org\/10.1007\/s11590-014-0750-x","journal-title":"Optim Lett"},{"issue":"2","key":"7602_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","volume":"8","author":"R Zhang","year":"2011","unstructured":"Zhang R, Kabadi SN, Punnen AP (2011) The minimum spanning tree problem with conflict constraints and its variations. Discret Optim 8(2):191\u2013205. https:\/\/doi.org\/10.1016\/j.disopt.2010.08.001","journal-title":"Discret Optim"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07602-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07602-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07602-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T10:30:38Z","timestamp":1680085838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07602-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,13]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["7602"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07602-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2022,11,13]]},"assertion":[{"value":"19 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author Barros BJS declares that he has no conflict of interest. Author Pinheiro RGS declares that he has no conflict of interest. Author Souza US declares that he has no conflict of interest. Author Ochi LS declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}