{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:26:55Z","timestamp":1737178015475,"version":"3.33.0"},"reference-count":20,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1080\/00207169208804049","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:17:59Z","timestamp":1182817079000},"page":"47-60","source":"Crossref","is-referenced-by-count":5,"title":["A genetic approach for network partitioning"],"prefix":"10.1080","volume":"42","author":[{"given":"Lin-Ming","family":"Jin","sequence":"first","affiliation":[]},{"given":"Shu-Park","family":"Chan","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"volume-title":"Computers and Intractability","year":"1979","author":"Gary M.R.","key":"CIT0001"},{"key":"CIT0002","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"Kernighan B.W.","year":"1970","journal-title":"Bell Syst. Tech.J"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M. and Mattheyses, R.M. A linear-time heuristic for improving network partitions. Proc. 19th Design Automation Conf. pp.175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676460"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"CIT0006","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B. and Gicht, D. 1985. Genetic algorithms for the traveling salesman problem. Proc. First International Conference on Genetic Algorithms and Their Applications. 1985. pp.160\u2013268."},{"key":"CIT0007","unstructured":"Goldberg, D. and Lingle, R. Jr. 1985. Alleles, loci, and the traveling salesman problem. Proc. First International Conference on Genetic Algorithms and Their Applications. 1985. pp.154\u2013159."},{"key":"CIT0008","unstructured":"Oliver, I., Smith, D. and Holland, J. 1987. A study of permutation crossover operations on the traveling salesman problem. Proc. Second International conference on Genetic Algorithms and Their Applications. 1987. pp.224\u2013230."},{"key":"CIT0009","unstructured":"Whitely, D., Starkweather, T. and Fuquay, Dann. 1989. Scheduling problems and traveling salesman: the genetic edge recombination operator. Proc. Third International Conference in Genetic Algorithms. 1989. pp.133\u2013140."},{"key":"CIT0010","unstructured":"Hesser, J., M\u00e4nner, R. and Stucky, O. 1989. Optimization of Steiner trees using genetic algorithms. Proc. Third International Conference in Genetic Algorithms. 1989. pp.231\u2013236."},{"key":"CIT0011","unstructured":"Pei, S. and Chan, S.P. 1990. Applications of genetic algorithm in neural network training. IASTED International Symposium on Robotics and Manufacturing. 1990. to be presented at"},{"key":"CIT0012","unstructured":"Cohoon, J.P. and Paris, W.D. 1986. Genetic placement. Proc. IEEE International Conference on Computer-Aided Design. 1986. pp.422\u2013425."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/43.55180"},{"key":"CIT0014","unstructured":"Fourman, M.P. 1985. Compaction of symbolic layout using genetic algorithms. Proc. of First International Conference on Genetic Algorithms. 1985. pp.141\u2013153."},{"volume-title":"Adaptation in natural and artificial systems","year":"1975","author":"Holland J.H.","key":"CIT0015"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1980.4308561"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289288"},{"volume-title":"Genetic algorithms in search, optimization, and machine learning","year":"1989","author":"Goldberg D.E.","key":"CIT0018"},{"journal-title":"private communication","year":"1989","author":"Goldberg D. E.","key":"CIT0019"},{"volume-title":"Analog component placement by genetic algorithms-part I: partitioning","year":"1990","author":"Jin Lin-Ming","key":"CIT0020"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169208804049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:39:32Z","timestamp":1737149972000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169208804049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1080\/00207169208804049"],"URL":"https:\/\/doi.org\/10.1080\/00207169208804049","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}