No CrossRef data available.
Article contents
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
Published online by Cambridge University Press: 15 August 2002
Abstract
A branch-and-bound method for solving the min cut with size constraint problem is presented. At each node of the branch-and-bound 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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001