Date of Original Version
Abstract or Description
We present a branch-and-price framework for solving the graph multicoloring problem. We propose column generation to implicitly optimize the linear programming relaxation of an independent set formulation (where there is one variable for each independent set in the graph) for graph multi-coloring. This approach, while requiring the solution of a difficult subproblem, is a promising method to obtain good solutions for small to moderate size problems quickly. Some implementation details and initial computational experience are presented.
eds. Edward K. Baker, Anito Joseph, Anuj Mehrotra and Michael A. Trick, Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies; Springer, 15-29.