SCOPUS 정보 검색 플랫폼

Volumn 38, Issue 11-13, 2003, Pages 1325-1332

Performance of a Genetic Algorithm for the Graph Partitioning Problem

Author keywords

Experimental comparison; Genetic algorithm; Graph partitioning; Local search strategy; Multistart local search; Simulated annealing

Indexed keywords

EID: 0345166079 PISSN: 08957177 EISSN: None Source Type: Journal
DOI: 10.1016/S0895-7177(03)90134-8 Document Type: Conference Paper

Times cited : (14)

References (10)

1
- 0031208744
- A branch and cut algorithm for the equicut problem
- L. Brunetta, M. Conforti and G. Rinaldi, A branch and cut algorithm for the equicut problem, Mathematical Programming 78, 243-263, (1997).
- (1997) Mathematical Programming , vol.78 , pp. 243-263
- Brunetta, L.¹ Conforti, M.² Rinaldi, G.³

2
- 84990479742
- An efficient heuristic procedure for partitioning graphs
- B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Systems Technical Journal 49, 291-307, (1970).
- (1970) Bell Systems Technical Journal , vol.49 , pp. 291-307
- Kernighan, B.W.¹ Lin, S.²

3
- 85046457769
- A linear-time heuristic for improving network partitions
- th ACM/IEEE Design Automation Conference, pp. 175-181, (1982).
- (1982) th ACM/IEEE Design Automation Conference , pp. 175-181
- Fiduccia, C.M.¹ Mattheyses, R.M.²

4
- 0032665591
- Greedy, prohibition, and reactive heuristics for graph partitioning
- R. Battiti and A. Bertossi, Greedy, prohibition, and reactive heuristics for graph partitioning, IEEE Trans. on Computers 48 (4), 361-385, (1999).
- (1999) IEEE Trans. on Computers , vol.48 , Issue.4 , pp. 361-385
- Battiti, R.¹ Bertossi, A.²

5
- 0001460554
- Genetic algorithm and graph partitioning
- T.N. Bui and B.R. Moon, Genetic algorithm and graph partitioning, IEEE Trans. on Computers 45 (7), 841-855, (1996).
- (1996) IEEE Trans. on Computers , vol.45 , Issue.7 , pp. 841-855
- Bui, T.N.¹ Moon, B.R.²

6
- 0024770085
- Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning
- D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning, Operations Research 38, 865-892, (1989).
- (1989) Operations Research , vol.38 , pp. 865-892
- Johnson, D.S.¹ Aragon, C.R.² McGeoch, L.A.³ Schevon, C.⁴

7
- 0029324885
- Partitioning of unstructured meshes for load balancing
- O.C. Martin and S.W. Otto, Partitioning of unstructured meshes for load balancing, Concurrency: Practice and Experience 7 (4), 303-314, (1995).
- (1995) Concurrency: Practice and Experience , vol.7 , Issue.4 , pp. 303-314
- Martin, O.C.¹ Otto, S.W.²

8
- 0034154795
- Fitness landscapes, memetic algorithms and greedy operators for graph bipartitioning
- P. Merz and B. Freisleben, Fitness landscapes, memetic algorithms and greedy operators for graph bipartitioning, Evolutionary Computation 8 (1), 61-91, (2000).
- (2000) Evolutionary Computation , vol.8 , Issue.1 , pp. 61-91
- Merz, P.¹ Freisleben, B.²

10
- 26444479778
- Optimization by simulated annealing
- S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220, 671-680, (1983).
- (1983) Science , vol.220 , pp. 671-680
- Kirkpatrick, S.¹ Gelatt, C.D.² Vecchi, M.P.³

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