Graph partitioning with general purpose solvers

I gave a talk at ROADEF2018 about using general-purpose solvers for large-scale partitioning problems. Although much slower than ad-hoc algorithms, they can still converge to a good solution with some help… and they can tackle much more complex models.

Links: