Solving the maximally balanced connected partition problem in graphs by using genetic algorithm (Q2844500)
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 6202763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximally balanced connected partition problem in graphs by using genetic algorithm |
scientific article; zbMATH DE number 6202763 |
Statements
29 August 2013
0 references
balanced partitions
0 references
evolutionary computation
0 references
metaheuristics
0 references
combinatorial optimization
0 references
Solving the maximally balanced connected partition problem in graphs by using genetic algorithm (English)
0 references
0.790641188621521
0 references
0.7899048924446106
0 references
0.7898865938186646
0 references
0.7800803184509277
0 references
0.7756488919258118
0 references
