Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem (Q1742597)
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 6858811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem |
scientific article; zbMATH DE number 6858811 |
Statements
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem (English)
0 references
12 April 2018
0 references
0.8410120010375977
0 references
0.7794052958488464
0 references
0.7780439853668213
0 references
