{"id":"https://openalex.org/W2392385314","doi":null,"title":"Competitive Decision Algorithm for Multi-objective Minimum Spanning tree Problem","display_name":"Competitive Decision Algorithm for Multi-objective Minimum Spanning tree Problem","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2392385314","mag":"2392385314"},"language":"en","primary_location":{"id":"mag:2392385314","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=GCXT201004017","pdf_url":null,"source":{"id":"https://openalex.org/S153020912","display_name":"Systems Engineering","issn_l":"1098-1241","issn":["1098-1241","1520-6858"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-2","poland-40","russia-white-list-1"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Systems Engineering","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2392385314"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5001207472","display_name":"Xiong Xiao","orcid":"https://orcid.org/0000-0002-3831-043X","observed_orcids":["https://orcid.org/0000-0002-3831-043X","https://orcid.org/0009-0009-2088-7714"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiong Xiao-hua","raw_affiliation_strings":["-Hua1,2,MA Liang1,NING Ai-Bing1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"-Hua1,2,MA Liang1,NING Ai-Bing1","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101926080","display_name":"Liang Ma","orcid":"https://orcid.org/0000-0002-4347-4180","observed_orcids":["https://orcid.org/0000-0002-4347-4180"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang Ma","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4347-4180","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054243342","display_name":"Ning Ai-bing","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ning Ai-bing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5001207472"],"corresponding_institution_ids":[],"apc_list":{"value":3140,"currency":"USD","value_usd":3140},"apc_paid":null,"fwci":0.3239,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51228629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":94},"biblio":{"volume":"28","issue":"4","first_page":"89","last_page":"93"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9570000171661377,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9570000171661377,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.017799999564886093,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.006399999838322401,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pareto-optimal-solutions","display_name":"Pareto optimal solutions","score":0.8889999985694885},{"id":"https://openalex.org/keywords/solution-diversity","display_name":"solution diversity","score":0.652999997138977},{"id":"https://openalex.org/keywords/neighborhood-search","display_name":"neighborhood search","score":0.8420000076293945},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.7070000171661377},{"id":"https://openalex.org/keywords/pareto-front-distribution","display_name":"Pareto front distribution","score":0.5879999995231628}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7220426201820374},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7079233527183533},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.701666533946991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6357402801513672},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6105237603187561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4580068290233612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4496392607688904},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4403040409088135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4399193525314331},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.43521714210510254},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43440014123916626},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43434226512908936},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2392385314","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=GCXT201004017","pdf_url":null,"source":{"id":"https://openalex.org/S153020912","display_name":"Systems Engineering","issn_l":"1098-1241","issn":["1098-1241","1520-6858"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-2","poland-40","russia-white-list-1"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Systems Engineering","raw_type":null},{"id":"mag:2744745463","doi":null,"is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/public/201602298632282430","pdf_url":null,"source":{"id":"https://openalex.org/S4306535149","display_name":"Xitong Gongcheng","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Xitong Gongcheng","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1518173249","https://openalex.org/W2807218612","https://openalex.org/W2369855040","https://openalex.org/W2387620824","https://openalex.org/W2371157450","https://openalex.org/W2066124178","https://openalex.org/W2347358673","https://openalex.org/W2921145543","https://openalex.org/W3003351355","https://openalex.org/W2020978161"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,7,26,38],"mechanism":[3],"of":[4,9,30,41,51,61],"competitions":[5],"and":[6,28,57],"feature":[8],"multi-objective":[10,17,52],"optimization":[11],"problem,a":[12],"competitive":[13],"decision":[14],"algorithm":[15,46],"for":[16],"minimum":[18,53],"spanning":[19,54],"tree":[20],"is":[21],"presented.In":[22],"order":[23],"to":[24,47,68],"improve":[25],"diversity":[27],"distribution":[29],"Pareto":[31],"optimal":[32,42],"set,it":[33],"performs":[34],"neighborhood":[35],"search":[36],"in":[37],"sparse":[39],"area":[40],"set.We":[43],"use":[44],"this":[45],"solve":[48],"many":[49],"instances":[50],"tree.After":[55],"testing":[56],"verifying":[58],"a":[59],"lot":[60],"data,the":[62],"computational":[63],"result":[64],"results":[65],"are":[66],"proved":[67],"have":[69],"better":[70],"performance.":[71]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2392385314","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
