Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:09, 1 February 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
