{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T10:51:21Z","timestamp":1771843881021,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11581,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1016\/0166-218x(81)90004-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"263-273","source":"Crossref","is-referenced-by-count":81,"title":["Stochastic spanning tree problem"],"prefix":"10.1016","volume":"3","author":[{"given":"Hiroaki","family":"Ishii","sequence":"first","affiliation":[]},{"given":"Sh\u014dgo","family":"Shiode","sequence":"additional","affiliation":[]},{"given":"Toshio","family":"Nishida","sequence":"additional","affiliation":[]},{"given":"Yoshikazu","family":"Namasuya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90004-4_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","article-title":"Chance Constrained Programming","volume":"6","author":"Charnes","year":"1959","journal-title":"Management Sci"},{"key":"10.1016\/0166-218X(81)90004-4_BIB2","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0166-218X(81)90004-4_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/net.3230080304","article-title":"A good algorithm for smallest spanning trees with a degree constraint","volume":"8","author":"Gabow","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0166-218X(81)90004-4_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/1910956","article-title":"A stochastic programming model","volume":"13","author":"Kataoka","year":"1963","journal-title":"Econometrica"},{"key":"10.1016\/0166-218X(81)90004-4_BIB5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc"},{"key":"10.1016\/0166-218X(81)90004-4_BIB6","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell. System Tech. J"},{"key":"10.1016\/0166-218X(81)90004-4_BIB7","series-title":"Stochastic Programming","author":"Sengupta","year":"1972"},{"key":"10.1016\/0166-218X(81)90004-4_BIB8","series-title":"Probabilistic Programming","author":"Vajda","year":"1972"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:18Z","timestamp":1555190598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["0166218X81900044"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90004-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}