{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:07:54Z","timestamp":1725491274506},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540743767"},{"type":"electronic","value":"9783540743774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74377-4_14","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T05:38:34Z","timestamp":1189575514000},"page":"123-132","source":"Crossref","is-referenced-by-count":0,"title":["A Centralized Network Design Problem with Genetic Algorithm Approach"],"prefix":"10.1007","author":[{"given":"Gengui","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqing","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"R.K. Ahuja","year":"2003","unstructured":"Ahuja, R.K., Orlin, J.B., Sharma, D.: A positive very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research letters\u00a031, 185\u2013194 (2003)","journal-title":"Operations Research letters"},{"key":"14_CR2","first-page":"2","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"T. B\u00e4ck","year":"1991","unstructured":"B\u00e4ck, T., Hoffmeister, F., Schwefel, H.: A survey of evolution strategy. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 2\u20139. Morgan Kaufmann Publishers, San Mateo,CA (1991)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230030204","volume":"3","author":"K.M. Chandy","year":"1973","unstructured":"Chandy, K.M., Lo, T.: The capacitated minimum spanning tree. Networks\u00a03, 173\u2013182 (1973)","journal-title":"Networks"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1109\/TCOM.1974.1092122","volume":"22","author":"D. Elias","year":"1974","unstructured":"Elias, D., Ferguson, M.J.: Topological design of multipoint teleprocessing networks. IEEE Trans. Commun.\u00a022, 1753\u20131762 (1974)","journal-title":"IEEE Trans. Commun."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","year":"1979","key":"14_CR5","unstructured":"Garey, M., Johnson, D. (eds.): Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Co, San Francisco (1979)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"Gavish, B.: Topological design of centralized computer networks\u2013formulation and algorithms. Networks\u00a012, 355\u2013377 (1982)","journal-title":"Networks"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"Gavish, B.: Formulation and algorithms for the capacitated minimal directed tree problem. J. Assoc. Comput. Machinery\u00a030, 118\u2013132 (1983)","journal-title":"J. Assoc. Comput. Machinery"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"33","author":"B. Gavish","year":"1985","unstructured":"Gavish, B.: Augmented lagrangean based algorithms for centralized network design. IEEE transaction on Commun.\u00a033, 1247\u20131257 (1985)","journal-title":"IEEE transaction on Commun."},{"key":"14_CR9","volume-title":"Genetic Algorithms and Engineering Optimization","author":"M. Gen","year":"2000","unstructured":"Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. John Wiley & Sons, New York (2000)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L.: A 2\n                    n\n                   constraint formulation for the capacitated minimal spanning tree problem. Operations Research\u00a043, 130\u2013141 (1995)","journal-title":"Operations Research"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","volume":"8","author":"L. Hall","year":"1996","unstructured":"Hall, L.: Experience with a cutting plane algorithm for the capacitated spanning tree problem. INFORMS Journal on Computing\u00a08, 219\u2013234 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"14_CR12","volume-title":"Adaptation in natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in natural and Artificial Systems. MIT Press, Cambridge, MA (1975)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/net.3230040403","volume":"4","author":"A. Kershenbaum","year":"1974","unstructured":"Kershenbaum, A.: Computing capacitated minimal spanning trees efficiently. Networks\u00a04, 299\u2013310 (1974)","journal-title":"Networks"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230130211","volume":"13","author":"A. Kershenbaum","year":"1983","unstructured":"Kershenbaum, A., Boorstyn, R.R., Oppenheim, R.: Centralized teleprocessing network design. Networks\u00a013, 279\u2013293 (1983)","journal-title":"Networks"},{"key":"14_CR15","volume-title":"Telecommunication Network Design Algorithms","author":"A. Kershenbaum","year":"1993","unstructured":"Kershenbaum, A.: Telecommunication Network Design Algorithms. McGraw-Hill, Inc, Singapore (1993)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1002\/net.3230230603","volume":"23","author":"K. Malik","year":"1993","unstructured":"Malik, K., Yu, G.: A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks\u00a023, 525\u2013532 (1993)","journal-title":"Networks"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C.H. Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.H.: The complexity of the capacitated tree problem. Networks\u00a08, 217\u2013230 (1978)","journal-title":"Networks"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1016\/j.cor.2004.11.019","volume":"33","author":"M. Reimann","year":"2006","unstructured":"Reimann, M., Laumanns, M.: Savings based ant colony optimization for the capacitated minimum spanning tree problem. Computers & Operations Research\u00a033, 1794\u20131822 (2006)","journal-title":"Computers & Operations Research"},{"key":"14_CR19","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 effective genetic algorithm approach to the quadratic minimum spanning tree problem. Computer & Operations Research\u00a025, 229\u2013237 (1998)","journal-title":"Computer & Operations Research"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1057\/palgrave.jors.2601510","volume":"54","author":"G. Zhou","year":"2003","unstructured":"Zhou, G., Gen, M.: A genetic algorithm approach on tree-like telecommunication network design problem. Journal of The Operational Research Society\u00a054, 248\u2013254 (2003)","journal-title":"Journal of The Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74377-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:21:24Z","timestamp":1619518884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74377-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540743767","9783540743774"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74377-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}