Academic
Academic
Home
Experience
Accomplishments
Publications
Light
Dark
Automatic
Phablo F. S. Moura
Latest
Partitioning a graph into balanced connected classes: Formulations, separation and experiments
Cut and Flow Formulations for the Balanced Connected k-Partition Problem
Cite
×