A branch-and-cut algorithm for the equicut problem

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.

[1]  G. Rinaldi,et al.  A cutting plane algorithm for the max-cut problem. , 1992 .

[2]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[3]  Antonio Sassano,et al.  The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..

[4]  Cid C. de Souza,et al.  Some New Classes of Facets for the Equicut Polytope , 1995, Discret. Appl. Math..

[5]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[6]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[7]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[8]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[9]  Michael A. Saunders,et al.  Inertia-Controlling Methods for General Quadratic Programming , 1991, SIAM Rev..

[10]  Antonio Sassano,et al.  The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..

[11]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[12]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[13]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[14]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..