Performance of a genetic algorithm for the graph partitioning problem (Q596896)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2082364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance of a genetic algorithm for the graph partitioning problem |
scientific article; zbMATH DE number 2082364 |
Statements
Performance of a genetic algorithm for the graph partitioning problem (English)
0 references
6 August 2004
0 references
Graph partitioning
0 references
Genetic algorithm
0 references
Local search
0 references
strategy
0 references
Multistart local search
0 references
Simulated annealing
0 references
Experimental comparison
0 references
0 references
0.8661744594573975
0 references
0.8386263847351074
0 references
0.8045113682746887
0 references
0.7931432127952576
0 references
