{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:57:52Z","timestamp":1725551872513},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308188"},{"type":"electronic","value":"9783540315995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596448_43","type":"book-chapter","created":{"date-parts":[[2006,6,17]],"date-time":"2006-06-17T09:12:37Z","timestamp":1150535557000},"page":"297-302","source":"Crossref","is-referenced-by-count":5,"title":["A Novel Genetic Algorithm for Multi-criteria Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Lixia","family":"Han","sequence":"first","affiliation":[]},{"given":"Yuping","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","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":"43_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische math.\u00a01, 269\u2013271 (1959)","journal-title":"Numerische math."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF00938448","volume":"45","author":"H.W. Corley","year":"1985","unstructured":"Corley, H.W.: Efficient Spanning Trees. Journal of Optimization Theory and Application\u00a045, 481\u2013485 (1985)","journal-title":"Journal of Optimization Theory and Application"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02032304","volume":"52","author":"H.W. Hammacker","year":"1994","unstructured":"Hammacker, H.W., Ruhe, G.: On Spanning Tree Problems with Multiple Objectives. Annals of Operations Research\u00a052, 209\u2013230 (1994)","journal-title":"Annals of Operations Research"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","volume":"114","author":"G. Zhou","year":"1999","unstructured":"Zhou, G., Gen, M.: Genetic Algorithm Approach on Multi-criteria Minimum Spanning Tree Problem. European Journal of Operational Research\u00a0114, 141\u2013152 (1999)","journal-title":"European Journal of Operational Research"},{"key":"43_CR6","first-page":"50","volume":"7","author":"G. Zhou","year":"1998","unstructured":"Zhou, G., Gen, M.: Genetic Algorithm on Leaf-constrained Minimum Spanning Tree Problem. Beijing Math.\u00a07, 50\u201362 (1998)","journal-title":"Beijing Math."},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/4235.930313","volume":"5","author":"H. Chou","year":"2001","unstructured":"Chou, H., Premkumar, G., Chu, C.H.: Genetic Algorithms for Communications Network Design-An empirical Study of the Factors that Influence Performance. IEEE Transaction on Evolutionary Computation\u00a05, 236\u2013249 (2001)","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J. Knowles","year":"2000","unstructured":"Knowles, J., Corne, D.: A New Evolutionary Approach to the Degree Constrained Minimum Spanning Tree Problem. IEEE Transaction on Evolutionary Computation\u00a04, 125\u2013134 (2000)","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G.R. Raidl","year":"2003","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge Sets: An Effective Evolutionary Coding of Spanning Trees. IEEE Trans. Evolutionary Computation\u00a07, 225\u2013239 (2003)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"43_CR10","volume-title":"Probability, Statistic, and Queuing Theory with Computer Science Application","author":"O. Allen Arnold","year":"1990","unstructured":"Allen Arnold, O.: Probability, Statistic, and Queuing Theory with Computer Science Application, 2nd edn. Academic Press, Inc., Bostion (1990)","edition":"2"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"4","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithm: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. on Evolutionary Computation\u00a04, 257\u2013271 (1999)","journal-title":"IEEE Trans. on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596448_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:56:07Z","timestamp":1619492167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596448_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308188","9783540315995"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11596448_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}