{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:32Z","timestamp":1777870592138,"version":"3.51.4"},"reference-count":50,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T00:00:00Z","timestamp":1771718400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2026.02.024","type":"journal-article","created":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T23:07:37Z","timestamp":1771801657000},"page":"191-208","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Target-based distributionally robust minimum spanning tree problem"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5197-8272","authenticated-orcid":false,"given":"Yang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5951-0580","authenticated-orcid":false,"given":"Ginger Y.","family":"Ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2368-210X","authenticated-orcid":false,"given":"Runjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4754-2925","authenticated-orcid":false,"given":"Lianmin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0001","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1007\/s11227-010-0484-1","article-title":"A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs","volume":"59","author":"Akbari Torkestani","year":"2012","journal-title":"The Journal of Supercomputing"},{"key":"10.1016\/j.ejor.2026.02.024_bib0002","series-title":"Probability on discrete structures","first-page":"1","article-title":"The objective method: Probabilistic combinatorial optimization and local weak convergence","author":"Aldous","year":"2004"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0003","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<118::AID-NET3>3.0.CO;2-M","article-title":"State space partition algorithms for stochastic systems with applications to minimum spanning trees","volume":"35","author":"Alexopoulos","year":"2000","journal-title":"Networks: An International Journal"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0004","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","article-title":"On the complexity of the robust spanning tree problem with interval data","volume":"32","author":"Aron","year":"2004","journal-title":"Operations Research Letters"},{"issue":"5439","key":"10.1016\/j.ejor.2026.02.024_bib0005","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0006","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","article-title":"Theory and applications of robust optimization","volume":"53","author":"Bertsimas","year":"2011","journal-title":"SIAM Review"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0007","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.02.024_bib0008","series-title":"Modern graph theory","first-page":"215","article-title":"Random graphs","author":"Bollob\u00e1s","year":"2011"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0009","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1287\/opre.2021.0654","article-title":"Robust CARA optimization","volume":"73","author":"Chen","year":"2025","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0010","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/msom.2014.0500","article-title":"The impact of a target on newsvendor decisions","volume":"17","author":"Chen","year":"2015","journal-title":"Manufacturing & Service Operations Management"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0011","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.1080.0570","article-title":"Goal-driven optimization","volume":"57","author":"Chen","year":"2009","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0012","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ejor.2008.06.039","article-title":"A polynomial solvable minimum risk spanning tree problem with interval data","volume":"198","author":"Chen","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0013","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Liu, Y., Tkocz, T., & Xu, A. (2022). Typical values of extremal-weight combinatorial structures with independent symmetric weights. arXiv preprint arXiv:2211.12348.","DOI":"10.37236\/10237"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0014","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.2022.2407","article-title":"The inventory routing problem under uncertainty","volume":"71","author":"Cui","year":"2023","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0015","series-title":"Computational intelligence for modelling, control and automation, international conference on","first-page":"203","article-title":"An evolutionary approach to solve minimum spanning tree problem with fuzzy parameters","volume":"vol. 1","author":"de Almeida","year":"2005"},{"issue":"6","key":"10.1016\/j.ejor.2026.02.024_bib0016","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1007\/s00453-022-01024-9","article-title":"A stronger lower bound on parametric minimum spanning trees","volume":"85","author":"Eppstein","year":"2023","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.024_bib0017","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02985423","article-title":"Stochastic finance. An introduction in discrete time","volume":"26","author":"F\u00f6llmer","year":"2004","journal-title":"The Mathematical Intelligencer"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0018","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1017\/S0963548317000426","article-title":"On edge-disjoint spanning trees in a randomly weighted complete graph","volume":"27","author":"Frieze","year":"2018","journal-title":"Combinatorics, Probability and Computing"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0019","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1287\/moor.2021.1184","article-title":"A randomly weighted minimum arborescence with a random cost constraint","volume":"47","author":"Frieze","year":"2022","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0020","series-title":"Proceedings of the 8th annual conference on genetic and evolutionary computation","first-page":"1187","article-title":"Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO","author":"Gruber","year":"2006"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0021","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1287\/opre.2015.1382","article-title":"Managing underperformance risk in project portfolio selection","volume":"63","author":"Hall","year":"2015","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0022","series-title":"2008 3rd International conference on innovative computing information and control","first-page":"493","article-title":"A model and algorithm for minimum spanning tree problems in uncertain networks","author":"He","year":"2008"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0023","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: First steps","volume":"5","author":"Holland","year":"1983","journal-title":"Social Networks"},{"key":"10.1016\/j.ejor.2026.02.024_bib0024","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s10878-016-0089-6","article-title":"Recoverable robust spanning tree problem under interval uncertainty representations","volume":"34","author":"Hradovich","year":"2017","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.024_bib0025","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.1050.0214","article-title":"Bounding distributions for the weight of a minimum spanning tree in stochastic networks","volume":"53","author":"Hutson","year":"2005","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0026","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-006-0043-6","article-title":"Minimum spanning trees in networks with varying edge weights","volume":"146","author":"Hutson","year":"2006","journal-title":"Annals of Operations Research"},{"issue":"10-12","key":"10.1016\/j.ejor.2026.02.024_bib0027","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0895-7177(95)00183-3","article-title":"Confidence regional method of stochastic spanning tree problem","volume":"22","author":"Ishii","year":"1995","journal-title":"Mathematical and Computer Modelling"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0028","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/net.3230130311","article-title":"Stochastic bottleneck spanning tree problem","volume":"13","author":"Ishii","year":"1983","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.024_bib0029","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","article-title":"Stochastic spanning tree problem","volume":"3","author":"Ishii","year":"1981","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0030","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/opre.2015.1462","article-title":"Routing optimization under uncertainty","volume":"64","author":"Jaillet","year":"2016","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.024_bib0031","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1287\/opre.36.4.575","article-title":"Approximations for the random minimal spanning tree with application to network provisioning","volume":"36","author":"Jain","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0032","series-title":"Operations research and management science in the age of analytics","first-page":"130","article-title":"Wasserstein distributionally robust optimization: Theory and applications in machine learning","author":"Kuhn","year":"2019"},{"key":"10.1016\/j.ejor.2026.02.024_bib0033","series-title":"2011 IEEE 52nd annual symposium on foundations of computer science","first-page":"797","article-title":"Maximizing expected utility for stochastic combinatorial optimization problems","author":"Li","year":"2011"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.024_bib0034","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1016\/j.orl.2014.09.004","article-title":"Distributionally robust discrete optimization with entropic value-at-risk","volume":"42","author":"Long","year":"2014","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2026.02.024_bib0035","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","article-title":"Optimal trees","volume":"7","author":"Magnanti","year":"1995","journal-title":"Handbooks in Operations Research and Management Science"},{"issue":"2-3","key":"10.1016\/j.ejor.2026.02.024_bib0036","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0096-3003(94)90126-0","article-title":"Interval elimination method for stochastic spanning tree problem","volume":"66","author":"Mohd","year":"1994","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0037","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","article-title":"A benders decomposition approach for the robust spanning tree problem with interval data","volume":"174","author":"Montemanni","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0038","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","article-title":"A branch and bound algorithm for the robust spanning tree problem with interval data","volume":"161","author":"Montemanni","year":"2005","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0039","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.2019.1002","article-title":"Budgeted prize-collecting traveling salesman and minimum spanning tree problems","volume":"45","author":"Paul","year":"2020","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.ejor.2026.02.024_bib0040","series-title":"Probabilistic constrained optimization: Methodology and applications","first-page":"272","article-title":"Some remarks on the value-at-risk and the conditional value-at-risk","author":"Pflug","year":"2000"},{"key":"10.1016\/j.ejor.2026.02.024_bib0041","article-title":"Distributionally robust optimization: A review","author":"Rahimian","year":"2019","journal-title":"ArXiv Preprint ArXiv:1908.05659"},{"key":"10.1016\/j.ejor.2026.02.024_bib0042","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5802\/ojmo.15","article-title":"Frameworks and results in distributionally robust optimization","volume":"3","author":"Rahimian","year":"2022","journal-title":"Open Journal of Mathematical Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0043","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.orl.2005.12.007","article-title":"The robust minimum spanning tree problem: Compact and convex uncertainty","volume":"35","author":"Salazar-Neumann","year":"2007","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0044","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1007\/s12597-021-00538-0","article-title":"Robust discrete spanning tree problem: Local search algorithms","volume":"59","author":"Sharma","year":"2022","journal-title":"OPSEARCH"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.024_bib0045","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/ijoc.2014.0627","article-title":"Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems","volume":"27","author":"Shen","year":"2015","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.024_bib0046","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","article-title":"Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time","volume":"51","author":"Spielman","year":"2004","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"10.1016\/j.ejor.2026.02.024_bib0047","doi-asserted-by":"crossref","first-page":"4064","DOI":"10.1016\/j.asoc.2011.02.017","article-title":"Learning automata-based algorithms for solving stochastic minimum spanning tree problem","volume":"11","author":"Torkestani","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.024_bib0048","first-page":"1461","article-title":"Integer programming formulations for minimum spanning tree interdiction","volume":"33","author":"Wei","year":"2021","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0049","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","article-title":"The robust spanning tree problem with interval data","volume":"29","author":"Yaman","year":"2001","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.024_bib0050","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-018-1243-y","article-title":"Routing optimization with time windows under uncertainty","volume":"175","author":"Zhang","year":"2019","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172600161X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722172600161X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:23:52Z","timestamp":1777566232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722172600161X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S037722172600161X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.024","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Target-based distributionally robust minimum spanning tree problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}