A branch-and-cut algorithm for the equicut problem |
| |
Authors: | Lorenzo Brunetta Michele Conforti Giovanni Rinaldi |
| |
Institution: | (1) Dipartimento di Matematica Pura e Applicata, Università degli Studi di Padova, via Belzoni 7, 35131 Padova, Italy;(2) Istituto di Analisi dei Sistemi ed Informatica del CNR, Roma, Italy |
| |
Abstract: | We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane
procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge
sets that define an equicut. The cuts are generated by several separation procedures that will be described in the paper.
Whenever the cutting-plane procedure does not terminate with an optimal solution, the algorithm uses a branch-and-cut strategy.
We also describe the implementation of the algorithm and the interface with the LP solver. Finally, we report on computational
results on dense instances with sizes up to 100 nodes. |
| |
Keywords: | Equicut Max-cut Polyhedral theory Cutting-plane algorithm Heuristic algorithm Branch-and-cut |
本文献已被 SpringerLink 等数据库收录! |