{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T17:15:33Z","timestamp":1680455733914},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02031706","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T13:38:09Z","timestamp":1123853889000},"page":"177-187","source":"Crossref","is-referenced-by-count":3,"title":["Chance constrained bottleneck spanning tree problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Hiroaki","family":"Ishii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sh\u014dgo","family":"Shiode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02031706_CR1","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/net.3230130311","volume":"13","author":"H. Ishii","year":"1983","unstructured":"H. Ishii and T. Nishida, Stochastic bottleneck spanning tree problem, Networks 13 (1983) 443\u2013449.","journal-title":"Networks"},{"key":"BF02031706_CR2","first-page":"147","volume":"24","author":"H. Ishii","year":"1981","unstructured":"H. Ishii, S. Shiode and T. Nishida, Chance constrained spanning tree problem, J. Oper. Res. Soc. Japan 24 (1981) 147\u2013157.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF02031706_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"J.B. Kruskal Jr., On the shortest spanning subtree of a graph and traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF02031706_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A.C. Yao","year":"1975","unstructured":"A.C. Yao, AnO $$(|\\vartheta |\\log \\log |\\vartheta |)$$ algorithm for finding minimum spanning trees, Inf. Proc. Lett. 4 (1975) 21\u201323.","journal-title":"Inf. Proc. Lett."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02031706.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02031706\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02031706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T07:57:33Z","timestamp":1557820653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02031706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02031706"],"URL":"https:\/\/doi.org\/10.1007\/bf02031706","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}