{"id":"https://openalex.org/W2137018107","doi":"https://doi.org/10.1142/s0218488515500038","title":"Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights","display_name":"Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W2137018107","doi":"https://doi.org/10.1142/s0218488515500038","mag":"2137018107"},"language":"en","primary_location":{"id":"doi:10.1142/s0218488515500038","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488515500038","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems","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/A5002127031","display_name":"Jian Zhou","orcid":"https://orcid.org/0000-0001-7835-8879"},"institutions":[{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jian Zhou","raw_affiliation_strings":["School of Management, Shanghai University, Shanghai 200044, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Shanghai University, Shanghai 200044, China","institution_ids":["https://openalex.org/I113940042"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069999463","display_name":"Lu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lu Chen","raw_affiliation_strings":["School of Management, Shanghai University, Shanghai 200044, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Shanghai University, Shanghai 200044, China","institution_ids":["https://openalex.org/I113940042"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054563155","display_name":"Ke Wang","orcid":"https://orcid.org/0000-0003-1769-2800"},"institutions":[{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Wang","raw_affiliation_strings":["School of Management, Shanghai University, Shanghai 200044, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Shanghai University, Shanghai 200044, China","institution_ids":["https://openalex.org/I113940042"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002127031"],"corresponding_institution_ids":["https://openalex.org/I113940042"],"apc_list":null,"apc_paid":null,"fwci":5.7931,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.96078431,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"23","issue":"01","first_page":"49","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12135","display_name":"Fuzzy Systems and Optimization","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8767884969711304},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.855674684047699},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.7474707365036011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6491680145263672},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6245793700218201},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5720853209495544},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5571839809417725},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5461736917495728},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5137439966201782},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4597707986831665},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4388885498046875},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43131211400032043},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.427929162979126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42778584361076355},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4277617931365967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30931705236434937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2220456302165985},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20696023106575012},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.15144634246826172},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07918038964271545}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8767884969711304},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.855674684047699},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7474707365036011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6491680145263672},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6245793700218201},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5720853209495544},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5571839809417725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5461736917495728},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5137439966201782},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4597707986831665},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4388885498046875},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43131211400032043},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.427929162979126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42778584361076355},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4277617931365967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30931705236434937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2220456302165985},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20696023106575012},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.15144634246826172},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07918038964271545},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218488515500038","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488515500038","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320327281","display_name":"Jilin Office of Philosophy and Social Science","ror":null},{"id":"https://openalex.org/F4320335869","display_name":"National Social Science Fund of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W192169619","https://openalex.org/W1965680834","https://openalex.org/W1966375702","https://openalex.org/W1977545325","https://openalex.org/W1982280823","https://openalex.org/W2002508385","https://openalex.org/W2005560327","https://openalex.org/W2011565421","https://openalex.org/W2014473202","https://openalex.org/W2017927472","https://openalex.org/W2022323888","https://openalex.org/W2066120425","https://openalex.org/W2104433301","https://openalex.org/W2106968440","https://openalex.org/W2107989318","https://openalex.org/W2125306618","https://openalex.org/W2132221037","https://openalex.org/W2136536301","https://openalex.org/W2139905755","https://openalex.org/W2142062936","https://openalex.org/W2147044873","https://openalex.org/W2151376743","https://openalex.org/W2154041520","https://openalex.org/W2157904088","https://openalex.org/W2162316218","https://openalex.org/W2169303520","https://openalex.org/W2274279545","https://openalex.org/W2912189486","https://openalex.org/W3143971390","https://openalex.org/W4207057353","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W2390742649","https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W88291963","https://openalex.org/W3081212354","https://openalex.org/W2126785038","https://openalex.org/W2589768050"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,11,28,68,73,102,120,124,127],"uncertain":[4,18,48,56,105,116],"minimum":[5,50,83,107],"spanning":[6,51,58,84,108],"tree":[7,52,59,85,109],"(UMST)":[8],"problem":[9,71,75,86],"where":[10],"edge":[12],"weights":[13],"are":[14,61,134],"assumed":[15],"to":[16,22,94],"be":[17,77],"variables.":[19],"In":[20],"order":[21],"propose":[23],"effective":[24,95],"solving":[25],"methods":[26],"for":[27,40,114,138],"UMST":[29,70,129],"problem,":[30],"path":[31],"optimality":[32],"conditions":[33],"as":[34,36,136],"well":[35,137],"some":[37],"equivalent":[38,81,121],"definitions":[39],"two":[41],"commonly":[42],"used":[43],"types":[44],"of":[45,104],"UMST,":[46],"namely,":[47],"expected":[49,69],"(expected":[53],"UMST)":[54,111],"and":[55,72,118,126],"\u03b1-minimum":[57],"(\u03b1-UMST),":[60],"discussed.":[62],"It":[63],"is":[64,112,130],"shown":[65],"that":[66],"both":[67],"\u03b1-UMST":[74,125],"can":[76],"transformed":[78],"into":[79],"an":[80,115],"classical":[82],"on":[87],"a":[88],"corresponding":[89],"deterministic":[90],"graph,":[91,117],"which":[92],"leads":[93],"algorithms":[96],"with":[97],"low":[98],"computational":[99],"complexity.":[100],"Furthermore,":[101],"notion":[103],"most":[106,128],"(most":[110],"initiated":[113],"then":[119],"relationship":[122],"between":[123],"proved.":[131],"Numerical":[132],"examples":[133],"presented":[135],"illustration.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}