{"id":"https://openalex.org/W1967977254","doi":"https://doi.org/10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","title":"A note on genetic algorithms for degree-constrained spanning tree problems","display_name":"A note on genetic algorithms for degree-constrained spanning tree problems","publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W1967977254","doi":"https://doi.org/10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","mag":"1967977254"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5009640206","display_name":"Gengui Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I100248960","display_name":"Ashikaga University","ror":"https://ror.org/0330rc745","country_code":"JP","type":"education","lineage":["https://openalex.org/I100248960"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Gengui Zhou","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326, Japan","Department of Industrial and Systems Engineering Ashikaga Institute of Technology, Ashikaga, 326 Japan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326, Japan","institution_ids":["https://openalex.org/I100248960"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering Ashikaga Institute of Technology, Ashikaga, 326 Japan","institution_ids":["https://openalex.org/I100248960"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071913548","display_name":"Mitsuo Gen","orcid":"https://orcid.org/0000-0002-3670-1357"},"institutions":[{"id":"https://openalex.org/I100248960","display_name":"Ashikaga University","ror":"https://ror.org/0330rc745","country_code":"JP","type":"education","lineage":["https://openalex.org/I100248960"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Mitsuo Gen","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326, Japan","Department of Industrial and Systems Engineering Ashikaga Institute of Technology, Ashikaga, 326 Japan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326, Japan","institution_ids":["https://openalex.org/I100248960"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering Ashikaga Institute of Technology, Ashikaga, 326 Japan","institution_ids":["https://openalex.org/I100248960"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071913548"],"corresponding_institution_ids":["https://openalex.org/I100248960"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.4073,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.92056436,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"2","first_page":"91","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9848999977111816,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9839000105857849,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7274094820022583},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7189933657646179},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6205540299415588},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5799576044082642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5717759132385254},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5358579754829407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49841856956481934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4460596740245819},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.437252938747406},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4250245690345764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3467501699924469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15706196427345276}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7274094820022583},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7189933657646179},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6205540299415588},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5799576044082642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5717759132385254},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5358579754829407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49841856956481934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4460596740245819},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.437252938747406},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4250245690345764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3467501699924469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15706196427345276},{"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.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"The":[0],"degree-constrained":[1],"spanning":[2],"tree":[3],"problem":[4,21,38],"is":[5],"of":[6,23,50],"high":[7],"practical":[8],"importance.":[9],"Up":[10],"to":[11,18,35,46],"now,":[12],"there":[13],"are":[14],"few":[15],"effective":[16],"algorithms":[17,42],"solve":[19,36],"this":[20,28,37],"because":[22],"its":[24],"NP-hard":[25],"complexity.":[26],"In":[27],"paper,":[29],"we":[30],"present":[31],"a":[32],"new":[33],"approach":[34],"by":[39],"using":[40],"genetic":[41],"and":[43],"computational":[44],"results":[45],"demonstrate":[47],"the":[48,51],"effectiveness":[49],"proposed":[52],"approach.":[53],"\u00a9":[54],"1997":[55,64],"John":[56],"Wiley":[57],"&":[58],"Sons,":[59],"Inc.":[60],"Networks":[61],"30:":[62],"91\u201395,":[63]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}