메뉴 건너뛰기




Volumn , Issue , 2010, Pages 288-291

Genetic algorithm encoding representations for graph partitioning problems

Author keywords

Genetic algorithm coding; Graph partitioning; Redundancy and blindness

Indexed keywords

ALGORITHM ENCODING; DIRECT IMPACT; GRAPH PARTITIONING; GRAPH PARTITIONING PROBLEMS;

EID: 78650650493     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMWI.2010.5648133     Document Type: Conference Paper
Times cited : (32)

References (15)
  • 1
    • 0016898088 scopus 로고
    • The optimal partitioning of graphs
    • Christofides N., Brooker P., The optimal partitioning of graphs. SIAM J. Appl. Math. 30(1):55-69. 1976.
    • (1976) SIAM J. Appl. Math. , vol.30 , Issue.1 , pp. 55-69
    • Christofides, N.1    Brooker, P.2
  • 2
    • 0033354342 scopus 로고    scopus 로고
    • Parallel and distributed association mining: A survey
    • Zaki MJ., Parallel and distributed association mining: A survey. IEEE Concurency. 7(4):14-25. 1999.
    • (1999) IEEE Concurency , vol.7 , Issue.4 , pp. 14-25
    • Zaki, M.J.1
  • 3
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • Kernigan BW., Lin S., An efficient Heuristic Procedure for Partitioning Graphs. BELL System technical journal 291-307. 1970.
    • (1970) BELL System Technical Journal , pp. 291-307
    • Kernigan, B.W.1    Lin, S.2
  • 6
    • 0015206259 scopus 로고
    • A heuristic procedure for partitioning and mapping of computer logic blocks to modules
    • Russo RL., Oden PH., Wolff PK., A heuristic procedure for partitioning and mapping of computer logic blocks to modules. IEEE Trans. Comput., C-20:1455-1462. 1971.
    • (1971) IEEE Trans. Comput. , vol.C-20 , pp. 1455-1462
    • Russo, R.L.1    Oden, P.H.2    Wolff, P.K.3
  • 7
    • 0021412333 scopus 로고
    • A framework for solving VLSI graph problems
    • Bhatt S., Leighton T., A framework for solving VLSI graph problems. J. Comput. and System Sciences 28(22):300-343. 1984.
    • (1984) J. Comput. And System Sciences , vol.28 , Issue.22 , pp. 300-343
    • Bhatt, S.1    Leighton, T.2
  • 9
    • 0000098538 scopus 로고
    • Optimal political districting by implicit enumeration techniques
    • Garfinkel RS., Nemhauser GL., Optimal political districting by implicit enumeration techniques. Mangmnt. Sci., 16:495-508. 1970.
    • (1970) Mangmnt. Sci. , vol.16 , pp. 495-508
    • Garfinkel, R.S.1    Nemhauser, G.L.2
  • 10
    • 29144470404 scopus 로고    scopus 로고
    • A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem
    • Boulif M M. Boulif, K. Atif, A new Branch-&-Bound-enhanced genetic algorithm for the manufacturing cell formation problem, Comput. Operat. Res. 33:2219-2245. 2006.
    • (2006) Comput. Operat. Res. , vol.33 , pp. 2219-2245
    • Boulif Boulif, M.M.1    Atif, K.2
  • 15
    • 0026940060 scopus 로고
    • A genetic algorithm approach to the machine-component grouping problem with multiple objectives
    • Venugopal V., A genetic algorithm approach to the machine-component grouping problem with multiple objectives. Computers & Industrial Engineering, 22(4):469-80. 1992.
    • (1992) Computers & Industrial Engineering , vol.22 , Issue.4 , pp. 469-480
    • Venugopal, V.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.