{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:20:25Z","timestamp":1725560425856},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139345"},{"type":"electronic","value":"9783642139352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13935-2_14","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T10:46:31Z","timestamp":1279622791000},"page":"313-321","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Bottleneck Spanning Tree Problem on a Fuzzy Network"],"prefix":"10.1007","author":[{"given":"Yue","family":"Ge","sequence":"first","affiliation":[]},{"given":"Hiroaki","family":"Ishii","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Programming, Games and Transportation Networks","author":"C. Berge","year":"1965","unstructured":"Berge, C., Ghouila-Hour, A.: Programming, Games and Transportation Networks. Wiley, New York (1965)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"Cheriton, D., Tarjan, R.E.: Finding minimum spanning Trees. SIAM Journal on Computing\u00a05, 724\u2013742 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","volume-title":"Graph Theory: An Algorithmic Approach","author":"H.N. Christofides","year":"1975","unstructured":"Christofides, H.N.: Graph Theory: An Algorithmic Approach. Academic Press, New York (1975)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/net.3230080304","volume":"8","author":"H.N. Gabow","year":"1978","unstructured":"Gabow, H.N.: A good algorithm for a smallest spanning trees with an edge degree constraint. Networks\u00a08, 201\u2013208 (1978)","journal-title":"Networks"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1002\/net.3230230805","volume":"23","author":"S. Geetha","year":"1993","unstructured":"Geetha, S., Nair, K.P.K.: On stochastic spanning tree problem. Networks\u00a023, 675\u2013679 (1993)","journal-title":"Networks"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0895-7177(95)00183-3","volume":"22","author":"H. Ishii","year":"1995","unstructured":"Ishii, H., Matsutomi, T.: Confidence regional method of stochastic spanning tree problem. Mathematical Computer Modeling\u00a022, 77\u201382 (1995)","journal-title":"Mathematical Computer Modeling"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/net.3230130311","volume":"13","author":"H. Ishii","year":"1983","unstructured":"Ishii, H., Nishida, T.: Stochastic bottleneck spanning tree problem. Networks\u00a013, 443\u2013449 (1983)","journal-title":"Networks"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.15807\/jorsj.24.147","volume":"24","author":"H. Ishii","year":"1981","unstructured":"Ishii, H., Shiode, S., Nishida, T.: Chance constrained spanning tree problem. Journal of the Operations Research Society of Japan\u00a024, 147\u2013157 (1981)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","volume":"3","author":"H. Ishii","year":"1981","unstructured":"Ishii, H., Shiode, S., Nishida, T., Namasuya, Y.: Stochastic spanning tree problem. Discrete Applied Mathematics\u00a03, 263\u2013273 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.15807\/jorsj.39.247","volume":"39","author":"T. Itoh","year":"1996","unstructured":"Itoh, T., Ishii, H.: An approach based on necessity measure to the fuzzy spanning tree problems. Journal of the Operations Research Society of Japan\u00a039, 247\u2013257 (1996) (in Japanese)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0453-4514(00)88755-4","volume":"43","author":"H. Katagiri","year":"2000","unstructured":"Katagiri, H., Ishii, H.: Chance constrained bottleneck spanning tree problem with fuzzy random edge costs. Journal of the Operation Research Society of Japan\u00a043, 128\u2013137 (2000)","journal-title":"Journal of the Operation Research Society of Japan"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"797","DOI":"10.3156\/jfuzzy.12.6_79","volume":"12","author":"H. Katagiri","year":"2000","unstructured":"Katagiri, H., Ishii, H., Sakawa, M.: A fuzzy spanning tree problem based on possibility and necessity. Journal of Japan Society for Fuzzy Theory and Systems\u00a012, 797\u2013805 (2000) (in Japanese)","journal-title":"Journal of Japan Society for Fuzzy Theory and Systems"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0377-2217(02)00523-4","volume":"152","author":"H. Katagiri","year":"2004","unstructured":"Katagiri, H., Sakawa, M., Ishii, H.: Fuzzy random bottleneck spanning tree problems using possibility and necessity measures. European Journal of Operational Research\u00a0152, 88\u201395 (2004)","journal-title":"European Journal of Operational Research"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and traveling salesman problem. Proceedings of American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proceedings of American Mathematical Society"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research\u00a04, 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest Connection Networks and Some Generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A.C. Yao","year":"1975","unstructured":"Yao, A.C.: An O(| E | log log | V |) algorithm for finding minimum spanning trees. Information Processing Letters\u00a04, 21\u201323 (1975)","journal-title":"Information Processing Letters"}],"container-title":["Studies in Fuzziness and Soft Computing","Fuzzy Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13935-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:37Z","timestamp":1606185937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13935-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139345","9783642139352"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13935-2_14","relation":{},"ISSN":["1434-9922","1860-0808"],"issn-type":[{"type":"print","value":"1434-9922"},{"type":"electronic","value":"1860-0808"}],"subject":[],"published":{"date-parts":[[2010]]}}}