Pages that link to "Item:Q2030323"
From MaRDI portal
The following pages link to Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323):
Displaying 14 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Mathematical political districting taking care of minority groups (Q2241590) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)
