15
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

A genetic approach for network partitioning

&
Pages 47-60 | Published online: 20 Mar 2007

References

  • Gary , M.R. and Johanson , D.S. 1979 . Computers and Intractability , Freeman .
  • Kernighan , B.W. and Lin , S. 1970 . An efficient heuristic procedure for partitioning graphs . Bell Syst. Tech.J , 49 : 291 – 307 .
  • Fiduccia , C.M. and Mattheyses , R.M. . A linear-time heuristic for improving network partitions . Proc. 19th Design Automation Conf . pp. 175 – 181 .
  • Krishnamurthy , B. 1984 . An improved min-cut algorithm for partitioning VLSI networks . IEEE Trans. Computers , C-33 ( 5 ) : 438 – 446 .
  • Kirkpatrick , S. , Gelatt , C.D. Jr. and Vecchi , M.P. 1983 . Optimization by simulated annealing . Science , 220 ( 4598 ) : 671 – 680 .
  • 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 – 268 .
  • 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 – 159 .
  • 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 – 230 .
  • 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 – 140 .
  • Hesser , J. , Männer , R. and Stucky , O. 1989 . Optimization of Steiner trees using genetic algorithms . Proc. Third International Conference in Genetic Algorithms . 1989 . pp. 231 – 236 .
  • 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
  • Cohoon , J.P. and Paris , W.D. 1986 . Genetic placement . Proc. IEEE International Conference on Computer-Aided Design . 1986 . pp. 422 – 425 .
  • Shahookar , K. and Mazumder , P. 1990 . A genetic approach to standard cell placement using meta-genetic parameter optimization . IEEE Trans. Computer-Aided Design , CAD-9 ( 5 ) : 500 – 511 .
  • Fourman , M.P. 1985 . Compaction of symbolic layout using genetic algorithms . Proc. of First International Conference on Genetic Algorithms . 1985 . pp. 141 – 153 .
  • Holland , J.H. 1975 . Adaptation in natural and artificial systems , Ann Arbor : University of Michigan .
  • Dejong , K.A. 1980 . Adaptive systems design: a genetic approach . IEEE Trans, on Systems, Man, and Cybernetics , SMC-10 ( 9 ) : 566 – 574 .
  • Grefenstette , J. 1986 . Optimization of control parameters for genetics algorithms . IEEE Trans, on Systems, Man, and Cybernetics , SMC-16 ( 1 ) : 122 – 128 .
  • Goldberg , D.E. 1989 . Genetic algorithms in search, optimization, and machine learning , Addison-Wesley .
  • Goldberg D. E. Messy genetic algorithms: motivation, analysis, and first results private communication February 1989 To appear
  • Jin , Lin-Ming and Chan , Shu-Park . 1990 . Analog component placement by genetic algorithms-part I: partitioning , Santa Clara University . CASRL report no. CASRL-1990-10-30, School of Engineering

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.