A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A branch-and-bound method for solving the min cut with size constraint problem is presented. At each node of the branch-andbound tree the feasible set is approximated by an ellipsoid and a lower bound is computed by minimizing the quadratic objective function over this ellipsoid. An upper bound is also obtained by a Tabu search method. Numerical results will be presented. Résumé. Nous présentons une méthode de Séparation etÉvaluation Progressive pour la bipartition d'un graphe en 2doi:10.1051/ro:2001122 fatcat:3hf34622hvfa3disg3n5dhbdei