{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:42:46Z","timestamp":1648539766839},"reference-count":15,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0140-3664(97)00069-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:53:54Z","timestamp":1027608834000},"page":"798-803","source":"Crossref","is-referenced-by-count":8,"title":["An efficient link enhancement strategy for computer networks using genetic algorithm"],"prefix":"10.1016","volume":"20","author":[{"given":"Debashis","family":"Saha","sequence":"first","affiliation":[]},{"given":"Uday Kumar","family":"Chakraborty","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00069-8_BIB1","series-title":"ORSA\/TIMS Joint National Meeting","article-title":"A multi-period architectural selection and optimum capacity allocation for future SONET inter office networks","author":"Wu","year":"1990"},{"key":"10.1016\/S0140-3664(97)00069-8_BIB2","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1016\/0169-7552(94)90021-3","article-title":"Topological expansion of metropolitan area networks","volume":"26","author":"Leblane","year":"1994","journal-title":"CN & ISDN Systems"},{"issue":"9","key":"10.1016\/S0140-3664(97)00069-8_BIB3","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0140-3664(92)90055-J","article-title":"Link enhancement using constrained range and reduced candidate set searches","volume":"15","author":"Yang","year":"1992","journal-title":"Computer Communications"},{"issue":"6","key":"10.1016\/S0140-3664(97)00069-8_BIB4","first-page":"301","article-title":"Budget management of network capacity planning by searching constrained range and dominant set","volume":"12","author":"Yang","year":"1994","journal-title":"IEEE Journal Select Areas Commun."},{"issue":"12","key":"10.1016\/S0140-3664(97)00069-8_BIB5","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/0140-3664(94)90030-2","article-title":"Capacity assignment in computer communication networks with unreliable links","volume":"17","author":"Saha","year":"1994","journal-title":"Computer Communications"},{"issue":"5","key":"10.1016\/S0140-3664(97)00069-8_BIB6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0140-3664(95)96839-I","article-title":"Design of hierarchical communication networks under node\/link failure constraints","volume":"18","author":"Saha","year":"1995","journal-title":"Computer Communications"},{"issue":"7","key":"10.1016\/S0140-3664(97)00069-8_BIB7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0140-3664(95)94377-N","article-title":"Computational analysis of an optimal routing strategy in a hierarchical computer communication network","volume":"18","author":"Saha","year":"1995","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(97)00069-8_BIB8","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0140-3664(97)00069-8_BIB9","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"issue":"4","key":"10.1016\/S0140-3664(97)00069-8_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(93)90027-7","article-title":"Using reliability analysis to estimate the number of generations to convergence in genetic algorithms","volume":"46","author":"Chakraborty","year":"1993","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/S0140-3664(97)00069-8_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(95)00116-T","article-title":"A simpler derivation of schema hazard in genetic algorithms","volume":"56","author":"Chakraborty","year":"1995","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/S0140-3664(97)00069-8_BIB12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(95)00113-X","article-title":"A branching process model for genetic algorithms","volume":"56","author":"Chakraborty","year":"1995","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/S0140-3664(97)00069-8_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1162\/evco.1996.4.2.133","article-title":"Analysis of selection algorithms: A Markov chain approach","volume":"4","author":"Chakraborty","year":"1996","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0140-3664(97)00069-8_BIB14","doi-asserted-by":"crossref","DOI":"10.1002\/(SICI)1099-1190(199607\/08)6:4<206::AID-NEM206>3.0.CO;2-T","article-title":"Managing the topological expansion of computer networks in an optimal way","author":"Saha","year":"1996","journal-title":"Int. Journal Network Management"},{"key":"10.1016\/S0140-3664(97)00069-8_BIB15","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000698?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T21:20:03Z","timestamp":1556400003000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0140366497000698"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00069-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}