A branch-and-cut algorithm for the equicut problem

A branch-and-cut algorithm for the equicut problem

0.00 Avg rating0 Votes
Article ID: iaor1999854
Country: Netherlands
Volume: 78
Issue: 2
Start Page Number: 243
End Page Number: 263
Publication Date: Aug 1997
Journal: Mathematical Programming
Authors: , ,
Keywords: branch-and-cut
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.

Reviews

Required fields are marked *. Your email address will not be published.