Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.059 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3118973667 / rank | |||
Normal rank | |||
Revision as of 19:13, 19 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
