{"id":"https://openalex.org/W7130951828","doi":"https://doi.org/10.1016/j.ejor.2026.02.024","title":"Target-based distributionally robust minimum spanning tree problem","display_name":"Target-based distributionally robust minimum spanning tree problem","publication_year":2026,"publication_date":"2026-02-01","ids":{"openalex":"https://openalex.org/W7130951828","doi":"https://doi.org/10.1016/j.ejor.2026.02.024"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2026.02.024","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.02.024","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.ejor.2026.02.024","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126570278","display_name":"Yang Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I4210138199","display_name":"University of Washington Applied Physics Laboratory","ror":"https://ror.org/03d17d270","country_code":"US","type":"facility","lineage":["https://openalex.org/I201448701","https://openalex.org/I4210138199"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Xu","raw_affiliation_strings":["Department of Industrial Engineering, University of Washington, Seattle, WA, 98195, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, University of Washington, Seattle, WA, 98195, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I4210138199","https://openalex.org/I58610484"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124855339","display_name":"Ginger Y. Ke","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ginger Y. Ke","raw_affiliation_strings":["Faculty of Business Administration, Memorial University of Newfoundland, St. John\u2019s, A1B 3X5, Newfoundland and Labrador, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Business Administration, Memorial University of Newfoundland, St. John\u2019s, A1B 3X5, Newfoundland and Labrador, Canada","institution_ids":["https://openalex.org/I130438778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008923128","display_name":"Runjie Li","orcid":"https://orcid.org/0000-0002-2368-210X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Runjie Li","raw_affiliation_strings":["Department of Industrial Engineering and Decision Analytics, Hong Kong University of Science and Technology, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Decision Analytics, Hong Kong University of Science and Technology, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5126574100","display_name":"Lianmin Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099586","display_name":"Shenzhen Research Institute of Big Data","ror":"https://ror.org/00z1gwf89","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210099586"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lianmin Zhang","raw_affiliation_strings":["Shenzhen International Center For Industrial And Applied Mathematics, Shenzhen Research Institute of Big Data, Shenzhen, 518115, China"],"affiliations":[{"raw_affiliation_string":"Shenzhen International Center For Industrial And Applied Mathematics, Shenzhen Research Institute of Big Data, Shenzhen, 518115, China","institution_ids":["https://openalex.org/I4210099586"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5124855339"],"corresponding_institution_ids":["https://openalex.org/I130438778"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.8382001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8210999965667725,"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.8210999965667725,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.045099999755620956,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02239999920129776,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.724399983882904},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7056000232696533},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7003999948501587},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.4936999976634979},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.44600000977516174},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4250999987125397},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.42480000853538513},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.423799991607666},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.3869999945163727}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.724399983882904},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7056000232696533},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7003999948501587},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6876000165939331},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4819999933242798},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.44600000977516174},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40720000863075256},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3720000088214874},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C2778865114","wikidata":"https://www.wikidata.org/wiki/Q7882489","display_name":"Uncertain data","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.26600000262260437},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25619998574256897},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ejor.2026.02.024","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.02.024","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.ejor.2026.02.024","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.02.024","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4044686555862427,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1558071713","https://openalex.org/W1931642009","https://openalex.org/W1971456873","https://openalex.org/W1972643866","https://openalex.org/W1972775205","https://openalex.org/W1974763826","https://openalex.org/W1984006984","https://openalex.org/W2004433626","https://openalex.org/W2008620264","https://openalex.org/W2011565421","https://openalex.org/W2014473202","https://openalex.org/W2034053794","https://openalex.org/W2055362601","https://openalex.org/W2067999800","https://openalex.org/W2075793153","https://openalex.org/W2081821894","https://openalex.org/W2084694919","https://openalex.org/W2102907934","https://openalex.org/W2104433301","https://openalex.org/W2105077362","https://openalex.org/W2119239894","https://openalex.org/W2131116400","https://openalex.org/W2134828066","https://openalex.org/W2142818506","https://openalex.org/W2165407100","https://openalex.org/W2165775468","https://openalex.org/W2167817347","https://openalex.org/W2236944418","https://openalex.org/W2418396476","https://openalex.org/W2790770006","https://openalex.org/W2962736195","https://openalex.org/W2987552422","https://openalex.org/W2994566040","https://openalex.org/W3162222637","https://openalex.org/W3189841424","https://openalex.org/W3215497626","https://openalex.org/W4288066793","https://openalex.org/W4310251530","https://openalex.org/W4392166807"],"related_works":[],"abstract_inverted_index":{"\u2022":[0,11,20,33,44],"Propose":[1],"a":[2,25,115,160],"target-based":[3,116,193],"distributionally":[4,117,194],"robust":[5,118,187,195],"MST":[6,42,172],"model":[7],"for":[8,122],"stochastic":[9,41,78,129,185],"graphs.":[10,130],"Handle":[12],"unknown":[13],"edge-weight":[14,52],"distributions":[15],"using":[16],"partial":[17],"statistical":[18,148],"information.":[19],"Develop":[21],"three":[22,157],"exact":[23,158],"algorithms:":[24],"BD":[26],"method":[27,163],"and":[28,37,60,164,178,186,208],"two":[29,165],"modified":[30,166],"Prim":[31],"heuristics.":[32],"Achieve":[34],"better":[35],"robustness":[36,209],"efficiency":[38,207],"than":[39],"classical":[40,167],"variants.":[43],"Scale":[45],"effectively":[46],"to":[47,150],"large":[48],"networks":[49,79],"under":[50],"significant":[51],"uncertainty.":[53],"The":[54],"minimum":[55,124,196],"spanning":[56,125,188,197],"tree":[57,126,189,198],"(MST)":[58],"problem":[59,127,173,200],"its":[61],"variants":[62],"have":[63,75],"been":[64],"extensively":[65],"studied":[66],"over":[67],"the":[68,81,94,123,134,139,171,182],"last":[69],"few":[70],"decades.":[71],"Recently,":[72],"more":[73],"efforts":[74],"focused":[76],"on":[77],"where":[80],"edge":[82,97,140],"weights":[83,141],"are":[84,89,102,176],"uncertain.":[85],"Those":[86],"efforts,":[87],"however,":[88],"often":[90],"overly":[91],"restricted":[92],"by":[93],"types":[95],"of":[96,138,170],"weight":[98],"random":[99],"variables":[100],"or":[101],"computationally":[103],"intractable,":[104],"particularly":[105],"in":[106,128,204],"large-scale":[107],"situations.":[108],"To":[109,153],"address":[110],"these":[111],"limitations,":[112],"we":[113,145],"propose":[114],"optimization":[119],"framework":[120],"designed":[121],"In":[131],"this":[132],"framework,":[133],"probability":[135],"distribution":[136],"function":[137],"is":[142],"unknown,":[143],"but":[144],"can":[146],"utilize":[147],"information":[149],"reduce":[151],"conservativeness.":[152],"seek":[154],"optimal":[155],"solutions,":[156],"algorithms,":[159],"Benders-decomposition-based":[161],"(BD)":[162],"greedy":[168],"algorithms":[169],"(Prim":[174],"algorithm),":[175],"constructed":[177],"tested.":[179],"Compared":[180],"with":[181,212],"traditional":[183],"NP-hard":[184],"problems,":[190],"our":[191],"proposed":[192],"(TDRMST)":[199],"demonstrates":[201],"superior":[202],"performance":[203],"both":[205],"algorithmic":[206],"when":[210],"dealing":[211],"input":[213],"uncertainties.":[214]},"counts_by_year":[],"updated_date":"2026-03-01T06:05:34.837733","created_date":"2026-02-23T00:00:00"}