A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945)
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 6573072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem |
scientific article; zbMATH DE number 6573072 |
Statements
A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (English)
0 references
25 April 2016
0 references
balanced graphs
0 references
graph partitioning
0 references
mixed integer linear programming
0 references
variable neighborhood search
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7908446788787842
0 references
0.790641188621521
0 references
0.7878046035766602
0 references
0.7592581510543823
0 references
0.7563769221305847
0 references
