Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A branch-and-price approach for the partition coloring problem|
de Souza, CC
|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. (c) 2011 Elsevier B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.