{"id":"https://openalex.org/W4309048396","doi":"https://doi.org/10.1007/s00500-022-07602-x","title":"Using adaptive memory in GRASP to find minimum conflict-free spanning trees","display_name":"Using adaptive memory in GRASP to find minimum conflict-free spanning trees","publication_year":2022,"publication_date":"2022-11-13","ids":{"openalex":"https://openalex.org/W4309048396","doi":"https://doi.org/10.1007/s00500-022-07602-x"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-022-07602-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-07602-x","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040503913","display_name":"Bruno Jos\u00e9 da Silva Barros","orcid":"https://orcid.org/0000-0002-5292-9589"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Bruno Jos\u00e9 da Silva Barros","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-5292-9589","affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015504097","display_name":"Rian G. S. Pinheiro","orcid":"https://orcid.org/0000-0002-8759-6286"},"institutions":[{"id":"https://openalex.org/I79889768","display_name":"Universidade Federal de Alagoas","ror":"https://ror.org/00dna7t83","country_code":"BR","type":"education","lineage":["https://openalex.org/I79889768"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Rian Gabriel S. Pinheiro","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal de Alagoas Avenida Lourival Mota, Cidade Universit\u00e1ria, Macei\u00f3, Alagoas, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal de Alagoas Avenida Lourival Mota, Cidade Universit\u00e1ria, Macei\u00f3, Alagoas, Brazil","institution_ids":["https://openalex.org/I79889768"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077019769","display_name":"U\u00e9verton S. Souza","orcid":"https://orcid.org/0000-0002-5320-9209"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"U\u00e9verton S. Souza","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016430153","display_name":"Luiz Satoru Ochi","orcid":"https://orcid.org/0000-0002-5007-4513"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz Satoru Ochi","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense Rua Passo da P\u00e1tria, S\u00e3o Domingos, Niter\u00f3i-RJ, 24210-240, Brazil","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040503913"],"corresponding_institution_ids":["https://openalex.org/I161127581"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19994399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"8","first_page":"4699","last_page":"4712"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.9002581834793091},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7729426622390747},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7609196901321411},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5943668484687805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5389346480369568},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5065783262252808},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48414334654808044},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.46849876642227173},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4656885862350464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41363051533699036},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.41139352321624756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3563554584980011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3454672694206238},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28945544362068176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22742107510566711}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9002581834793091},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7729426622390747},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7609196901321411},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5943668484687805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5389346480369568},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5065783262252808},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48414334654808044},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.46849876642227173},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4656885862350464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41363051533699036},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.41139352321624756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3563554584980011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3454672694206238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28945544362068176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22742107510566711},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-022-07602-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-022-07602-x","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W58198252","https://openalex.org/W179052057","https://openalex.org/W1966424245","https://openalex.org/W1982713256","https://openalex.org/W2002284890","https://openalex.org/W2017927472","https://openalex.org/W2046709864","https://openalex.org/W2049287714","https://openalex.org/W2116638623","https://openalex.org/W2116874075","https://openalex.org/W2117942072","https://openalex.org/W2120470208","https://openalex.org/W2140043891","https://openalex.org/W2166210809","https://openalex.org/W2499292135","https://openalex.org/W2510736311","https://openalex.org/W2541616316","https://openalex.org/W2595243011","https://openalex.org/W2618703364","https://openalex.org/W2664277112","https://openalex.org/W2806852865","https://openalex.org/W2895324310","https://openalex.org/W2916470116","https://openalex.org/W2997776631","https://openalex.org/W3001552150","https://openalex.org/W3044201904","https://openalex.org/W3104695357","https://openalex.org/W3109104928","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W2381121915","https://openalex.org/W2138987445","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2353025557","https://openalex.org/W2943635264","https://openalex.org/W2357347008","https://openalex.org/W4309048396","https://openalex.org/W2127336680"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}