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

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

0.00 Avg rating0 Votes
Article ID: iaor20133249
Volume: 39
Issue: 2
Start Page Number: 132
End Page Number: 137
Publication Date: Mar 2011
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.