Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: The vertex separator problem: a polyhedral investigation
Author: Balas, E
de Souza, CC
Abstract: The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subsets A, B, C such that there is no edge between A and B, and |C| is minimized subject to a bound on max {|A|, |B|}. We give a mixed integer programming formulation of the problem and investigate the vertex separator polytope (VSP), the convex hull of incidence vectors of vertex separators. Necessary and sufficient conditions are given for the VSP to be full dimensional. Central to our investigation is the relationship between separators and dominators. Several classes of valid inequalities are investigated, along with the conditions under which they are facet defining for the VSP. Some of our proofs combine in new ways projection with lifting. In a companion paper we develop a branch-and-cut algorithm for the (VS) problem based on the inequalities discussed here, and report on computational experience with a wide variety of (VS) problems drawn from the literature and inspired by various applications.
Country: EUA
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s10107-005-0574-7
Date Issue: 2005
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000229940200009.pdf257.11 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.