{"id":"https://openalex.org/W2946338515","doi":"https://doi.org/10.1007/s00500-019-04051-x","title":"A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem","display_name":"A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem","publication_year":2019,"publication_date":"2019-05-14","ids":{"openalex":"https://openalex.org/W2946338515","doi":"https://doi.org/10.1007/s00500-019-04051-x","mag":"2946338515"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-019-04051-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-019-04051-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/A5079993297","display_name":"Kavita Singh","orcid":"https://orcid.org/0000-0003-4012-6786"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kavita Singh","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042284939","display_name":"Shyam Sundar","orcid":"https://orcid.org/0000-0001-9679-0892"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shyam Sundar","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India","institution_ids":["https://openalex.org/I38335241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079993297"],"corresponding_institution_ids":["https://openalex.org/I38335241"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.2077,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89511308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"24","issue":"3","first_page":"2169","last_page":"2186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7182635068893433},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6029623746871948},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5911037921905518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5815026760101318},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5401507616043091},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5021252632141113},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46873411536216736},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46346938610076904},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.41344085335731506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41208022832870483},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39663243293762207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.385537326335907}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7182635068893433},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6029623746871948},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5911037921905518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5815026760101318},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5401507616043091},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5021252632141113},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46873411536216736},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46346938610076904},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.41344085335731506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41208022832870483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39663243293762207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.385537326335907},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00500-019-04051-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-019-04051-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":[],"awards":[{"id":"https://openalex.org/G7867575742","display_name":null,"funder_award_id":"YSS/2015/000276","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W154808347","https://openalex.org/W1527884540","https://openalex.org/W1588423454","https://openalex.org/W1659842140","https://openalex.org/W1948148225","https://openalex.org/W1967977254","https://openalex.org/W1995670816","https://openalex.org/W2002764437","https://openalex.org/W2004711524","https://openalex.org/W2011039300","https://openalex.org/W2014340938","https://openalex.org/W2016207616","https://openalex.org/W2017927472","https://openalex.org/W2033983963","https://openalex.org/W2041365558","https://openalex.org/W2043113141","https://openalex.org/W2053917692","https://openalex.org/W2054305792","https://openalex.org/W2060095317","https://openalex.org/W2068541550","https://openalex.org/W2076592479","https://openalex.org/W2093102835","https://openalex.org/W2126646301","https://openalex.org/W2126785038","https://openalex.org/W2142146559","https://openalex.org/W2152939155","https://openalex.org/W2156773695","https://openalex.org/W2161880126","https://openalex.org/W2166843422","https://openalex.org/W2550142813","https://openalex.org/W2598820717","https://openalex.org/W2606271435","https://openalex.org/W2888462900","https://openalex.org/W3021620738","https://openalex.org/W3023540311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2138987445","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W2357347008","https://openalex.org/W4302939663","https://openalex.org/W2157421865","https://openalex.org/W2069230977","https://openalex.org/W2088797223","https://openalex.org/W2290899160"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}