Home /Research /Partitioning a graph into balanced connected classes: Formulations, separation and experiments
OTHER

Partitioning a graph into balanced connected classes: Formulations, separation and experiments

Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi

Year
2021
Citations
35

Keywords

Linear programming relaxationPartition (number theory)Integer programmingTime complexityGraph partitionLinear programmingMathematicsCombinatoricsBinary numberBranch and cut

Related papers

Browse all OTHER papers