{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:29:25Z","timestamp":1725575365721},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213789"},{"type":"electronic","value":"9783540246534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24653-4_15","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T15:08:30Z","timestamp":1294844910000},"page":"140-149","source":"Crossref","is-referenced-by-count":0,"title":["A Genetic Algorithm for Telecommunication Network Design"],"prefix":"10.1007","author":[{"given":"Silvana","family":"Livramento","sequence":"first","affiliation":[]},{"given":"Arnaldo V.","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Fl\u00e1vio K.","family":"Miyazawa","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio M.","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio A.","family":"Miranda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","first-page":"239","volume":"33","author":"A. Balakrishman","year":"1991","unstructured":"Balakrishman, A., Magnanti, T.L., Shulman, A., Wong, R.T.: Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research\u00a033, 239\u2013284 (1991)","journal-title":"Annals of Operations Research"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Mathematical Programming\u00a060, 233\u2013250 (1993)","journal-title":"Mathematical Programming"},{"key":"15_CR3","first-page":"213","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Computational experience with a difficult mixed integer multicommodity flow problem. Mathematical Programming\u00a068, 213\u2013237 (1995)","journal-title":"Mathematical Programming"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0166-218X(87)90021-7","volume":"18","author":"H.P.L. Luna","year":"1987","unstructured":"Luna, H.P.L., Ziviani, N., Cabral, R.M.B.: The telephonic switching center network problem: Formalization and computational experience. Discrete Applied Mathematics\u00a018, 199\u2013210 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"Gavish, B.: Formulations and algorithms for the capacitated minimal directed tree. Journal of the ACM\u00a030, 118\u2013132 (1983)","journal-title":"Journal of the ACM"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"Gavish, B.: Topological design of telecommunication networks\u2014local access design methods. Annals of Operations Research\u00a033, 17\u201371 (1991)","journal-title":"Annals of Operations Research"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D.S. Hochbaum","year":"1989","unstructured":"Hochbaum, D.S., Segev, A.: Analysis of a flow problem with fixed charges. Networks\u00a019, 291\u2013312 (1989)","journal-title":"Networks"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009669927855","volume":"6","author":"G.R. Mateus","year":"2000","unstructured":"Mateus, G.R., Luna, H.P.L., Sirihal, A.B.: Heuristics for distribution network design in telecommunication. Journal of Heuristics\u00a06, 131\u2013148 (2000)","journal-title":"Journal of Heuristics"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Gourdin, E., Labb\u00e9, M., Yaman, H.: Telecommunication and location. Technical report, Service de Mathematiques de la Gestion, Universite Libre de Bruxelles (2001), http:\/\/citeseer.nj.nec.com\/587324.html","DOI":"10.1007\/978-3-642-56082-8_9"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1018950617642","volume":"86","author":"G.R. Mateus","year":"1999","unstructured":"Mateus, G.R., Thizy, J.-M.: Exact sequential choice of locations in a network. Annals of Operations Research\u00a086, 199\u2013219 (1999)","journal-title":"Annals of Operations Research"},{"volume-title":"Telecommunications Optimization: Heuristic and Adaptive Techniques","year":"2000","key":"15_CR11","unstructured":"Corne, D.W., Oates, M.J., Smith, G.D. (eds.): Telecommunications Optimization: Heuristic and Adaptive Techniques. Wiley, Chichester (2000)"},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055923","volume-title":"Genetic Programming: An Introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Publishers, Inc., San Francisco (1998)"},{"key":"15_CR13","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.A. Goldberg","year":"1989","unstructured":"Goldberg, D.A.: Genetic Algorithms in Search, Optimization and Machine Learning, January 1989. Addison-Wesley, Reading (1989)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. third, revised and extended edn., Springer, Heidelberg (1996)","DOI":"10.1007\/978-3-662-03315-9"},{"key":"15_CR15","volume-title":"How to solve it : modern heuristics","author":"Z. Michalewicz","year":"1999","unstructured":"Michalewicz, Z., Fogel, D.B.: How to solve it: modern heuristics. Springer, Heidelberg (1999)"},{"key":"15_CR16","unstructured":"Livramento, S., Moura, A.V., Miyazawa, F.K., Harada, M.M., Miranda, R.A.: Um algoritmo gen\u00e9tico para projeto de rede de telecomunica \u00e7\u00f5es. Technical Report IC-03-024, Instituto de Computa\u00e7\u00e3o - Unicamp (November 2003) (in Portuguese)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24653-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T06:30:26Z","timestamp":1637130626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24653-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213789","9783540246534"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24653-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}