{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:30:32Z","timestamp":1725471032636},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540459163"},{"type":"electronic","value":"9783540459170"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881599_127","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T06:05:25Z","timestamp":1158905125000},"page":"1025-1034","source":"Crossref","is-referenced-by-count":0,"title":["The Fuzzy Weighted k-Cardinality Tree and Its Hybrid Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Linzhong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ruichun","family":"He","sequence":"additional","affiliation":[]},{"given":"Yinzhen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"127_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cam.2003.08.027","volume":"162","author":"A. Boulmakoul","year":"2004","unstructured":"Boulmakoul, A.: Generalized path-finding algorithms on semirings and the fuzzy shortest path problem. Journal of Computational and Applied Mathematics\u00a0162, 263\u2013272 (2004)","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"127_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A. Charnes","year":"1959","unstructured":"Charnes, A., Copper, W.W.: Chance-constrained programming. Management Science\u00a06, 73\u201379 (1959)","journal-title":"Management Science"},{"key":"127_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0165-0114(99)00090-1","volume":"119","author":"P. Diamond","year":"2001","unstructured":"Diamond, P.: A fuzzy max-flow min-cut theorem. Fuzzy Sets and Systems\u00a0119, 139\u2013148 (2001)","journal-title":"Fuzzy Sets and Systems"},{"key":"127_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0165-0114(97)00291-1","volume":"100","author":"B. Liu","year":"1998","unstructured":"Liu, B., Iwamura, K.: A note on chance constrained programming with fuzzy coefficients. Fuzzy Sets and Systems\u00a0100, 229\u2013233 (1998)","journal-title":"Fuzzy Sets and Systems"},{"key":"127_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1781-2","volume-title":"Theory and Practice of Uncertain Programing","author":"B. Liu","year":"2002","unstructured":"Liu, B.: Theory and Practice of Uncertain Programing. Physica-Verlag, New York (2002)"},{"key":"127_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0165-0114(03)00225-2","volume":"142","author":"S. Okada","year":"2004","unstructured":"Okada, S.: Fuzzy shortest path problems incorporating interactivity among paths. Fuzzy Sets and Systems\u00a0142, 335\u2013357 (2004)","journal-title":"Fuzzy Sets and Systems"},{"key":"127_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0165-0114(98)00054-2","volume":"109","author":"S. Okada","year":"2000","unstructured":"Okada, S., Soper, T.: A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets and Systems\u00a0109, 129\u2013140 (2000)","journal-title":"Fuzzy Sets and Systems"},{"key":"127_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L.A. Zadeh","year":"1965","unstructured":"Zadeh, L.A.: Fuzzy sets. Information and Control\u00a08, 338\u2013353 (1965)","journal-title":"Information and Control"},{"key":"127_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0305-0548(97)00039-7","volume":"25","author":"G. Zhou","year":"1998","unstructured":"Zhou, G., Gen, M.: An efficient genetic algorithm approach to the quadratic minimum spanning problem. Computers ops. Res.\u00a025, 229\u2013237 (1998)","journal-title":"Computers ops. Res."},{"key":"127_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"R.K. Ahuja","year":"2000","unstructured":"Ahuja, R.K., Orlin, J.B.: A Faster Algorithm for the inverse spanning tree problem. Journal of Algorithms\u00a034, 177\u2013193 (2000)","journal-title":"Journal of Algorithms"},{"key":"127_CR11","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1016\/S0305-0548(02)00117-X","volume":"30","author":"T. Fujie","year":"2003","unstructured":"Fujie, T.: An exact algorithm for the maximum leaf spanning tree problem. Computers & Operations Research\u00a030, 1931\u20131944 (2003)","journal-title":"Computers & Operations Research"},{"key":"127_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","volume":"102","author":"B. Wu","year":"2000","unstructured":"Wu, B., Chao, K., Tang, C.: Approximation algorithms for some optimum communication spanning tree problems. Discrete Applied Mathematics\u00a0102, 245\u2013266 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"127_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"R. Graham","year":"1985","unstructured":"Graham, R., Hell, P.: On the history of minimum spanning tree problem. Annals of the History of Computing\u00a07, 43\u201357 (1985)","journal-title":"Annals of the History of Computing"},{"key":"127_CR14","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. J. of the Operations Research Society of Japan\u00a043, 128\u2013137 (2000)","journal-title":"J. of the Operations Research Society of Japan"},{"key":"127_CR15","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":"127_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0166-218X(03)00360-3","volume":"137","author":"R. Hassin","year":"2004","unstructured":"Hassin, R., Levin, A.: Minimum restricted diameter spanning trees. Discrete Applied Mathematics\u00a0137, 343\u2013357 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"127_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","volume":"22","author":"B. Boldon","year":"1996","unstructured":"Boldon, B., Deo, N., Kumar, N.: Minimum-weighted degree-constrained spanning tree problem: heuristics and complementation on an SIMD parallel machine. Parallel Computing\u00a022, 369\u2013382 (1996)","journal-title":"Parallel Computing"},{"key":"127_CR18","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/S0305-0548(96)00026-3","volume":"23","author":"K.A. Andersen","year":"1996","unstructured":"Andersen, K.A., Jornsten, K., Lind, M.: On bi-criterion minimal spanning trees: an approximation. Computers Operation Research\u00a023, 1171\u20131182 (1996)","journal-title":"Computers Operation Research"},{"key":"127_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00265-4","volume":"181","author":"G. Galbiati","year":"1997","unstructured":"Galbiati, G., Morzenti, A., Maffioli, F.: On the approximability of some maximum spanning tree problems. Theoretical Computer Science\u00a0181, 107\u2013118 (1997)","journal-title":"Theoretical Computer Science"},{"key":"127_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassia","year":"1995","unstructured":"Hassia, R., Tamir, A.: On the minimum diameter spanning tree problem. Information Processing Letters\u00a053, 109\u2013111 (1995)","journal-title":"Information Processing Letters"},{"key":"127_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"53","author":"S.O. Krumke","year":"1998","unstructured":"Krumke, S.O., Wirth, H.: On the minimum label spanning tree problem. Information Processing Letters\u00a053, 81\u201385 (1998)","journal-title":"Information Processing Letters"},{"key":"127_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(01)00216-5","volume":"115","author":"A. Kaneko","year":"2001","unstructured":"Kaneko, A.: Spanning trees with constraints on the leaf degree. Discrete Applied Mathematics\u00a0115, 73\u201376 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"127_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"53","author":"R. Chang","year":"1997","unstructured":"Chang, R., Leu, S.: The minimum labeling spanning trees. Information Processing Letters\u00a053, 277\u2013282 (1997)","journal-title":"Information Processing Letters"},{"key":"127_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. The Macmillan Press Ltd., Basingstoke (1976)"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Systems and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881599_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:29:20Z","timestamp":1619494160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881599_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459163","9783540459170"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11881599_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}