Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into balanced connected classes: formulations, separation and experiments |
scientific article |
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
