Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model.

The bandwidth coloring problem (BCP) is a generalization of the well-known vertex coloring problem (VCP), asking colors to be assigned to vertices of a graph such that the absolute difference between the colors assigned to adjacent vertices is greater than or equal to a weight associated to the edge connecting them. In this work we present an integer programming formulation for BCP based on the orientation model for VCP. We present two families of valid inequalities for this formulation, show that they induce facets of the associated polytope, and report computational experience suggesting that these families are useful in practice. [ABSTRACT FROM AUTHOR]