A branch-and-price approach for the partition coloring problem

Authors:
Edna A. Hoshino;Yuri A. Frota;Cid C. De Souza
Affiliations:
Faculty of Computing, Federal University of Mato Grosso do Sul, Campo Grande, Brazil;Universidade Federal Fluminense, Department of Computer Science, Niteroi, Brazil;Institute of Computing, University of Campinas, Campinas, Brazil
Venue:
Operations Research Letters
Year:
2011

Citing 3
Cited 0

Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
Cliques, holes and the vertex coloring polytope

Information Processing Letters
A branch-and-cut algorithm for partition coloring

Networks - Network Optimization (INOC 2007)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes a new integer programming model for the partition coloring problem and a branch-and-price algorithm to solve it. Experiments are reported for random graphs and instances originating from routing and wavelength assignment problems arising in telecommunication network design. We show that our method largely outperforms previously existing approaches.