Approche polyedrale pour le probleme du separateur (VSP)
Discrete Mathematics
2007-11-21 v1
Abstract
In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.
Cite
@article{arxiv.0711.3149,
title = {Approche polyedrale pour le probleme du separateur (VSP)},
author = {Marie-Jean Meurs},
journal= {arXiv preprint arXiv:0711.3149},
year = {2007}
}
Comments
21 pages, 4 figures