Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning a graph into balanced connected classes: formulations, separation and experiments |
scientific article; zbMATH DE number 7355894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into balanced connected classes: formulations, separation and experiments |
scientific article; zbMATH DE number 7355894 |
Statements
Partitioning a graph into balanced connected classes: formulations, separation and experiments (English)
0 references
7 June 2021
0 references
integer programming
0 references
branch-and-cut
0 references
separation algorithm
0 references
balanced partition
0 references
connected partition
0 references