| Article ID: | iaor20052748 |
| Country: | France |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 401 |
| End Page Number: | 414 |
| Publication Date: | Oct 2001 |
| Journal: | RAIRO Operations Research |
| Authors: | Maculan Nelson, Michelon Philippe, Ripeau Stphanie |
| Keywords: | programming: branch and bound, heuristics |
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 are presented.