Skip to Main content Skip to Navigation
Journal articles

An exact algorithm for solving the vertex separator problem

Abstract : Given G = (V, E) a connected undirected graph and a positive integer β(|V |), the vertex separator problem is to find a partition of V into no-empty three classes A, B, C such that there is no edge between A and B, max{|A|, |B|} ≤ β(|V |) and |C| is minimum. In this paper we consider the vertex separator problem from a polyhedral point of view. We introduce new classes of valid inequalities for the associated polyhedron. Using a natural lower bound for the optimal solution, we present successful computational experiments.
Document type :
Journal articles
Complete list of metadata
Contributor : Bibliothèque Universitaire Déposants Hal-Avignon <>
Submitted on : Thursday, May 19, 2016 - 5:03:24 PM
Last modification on : Monday, April 27, 2020 - 4:14:03 PM

Links full text



Mohamed Didi Biha, Marie-Jean Meurs. An exact algorithm for solving the vertex separator problem. Journal of Global Optimization, Springer Verlag, 2011, ⟨10.1007/s10898-010-9568-y⟩. ⟨hal-01318627⟩



Record views