A branch-and-cut algorithm for the equicut problem

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

Finding optimal solutions to the graph partitioning problem with heuristic search

Annals of Mathematics and Artificial Intelligence

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Discrete Applied Mathematics

Performance of a genetic algorithm for the graph partitioning problem

Mathematical and Computer Modelling: An International Journal

Facet-defining inequalities for the simple graph partitioning polytope

Discrete Optimization

A branch-and-bound algorithm for the minimum cut linear arrangement problem

Journal of Combinatorial Optimization

Better bounds for graph bisection

ESA'12 Proceedings of the 20th Annual European conference on Algorithms