Year
2016
Abstract
Despite the fact that many vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not “under control” from a polyhedral point of view. The equivalence between optimization and separation suggests the existence of integer programming formulations for these problems whose associated polytopes admit elegant characterizations. In this work we address this issue. As a starting point, we focus our attention on the well-known standard formulation for the classical vertex coloring problem.
DELLE DONNE, D. et MARENCO, J. (2016). Polyhedral studies on vertex coloring polytope: The standard formulation. Discrete Optimization, 21(1), pp. 1-13.