Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem

Résumé

The Sum Colouring Problem is an NP-hard problem derived from the well-known graph colouring problem. It consists in finding a proper colouring which minimizes the sum of the assigned colours rather than the number of those colours. This problem often arises in scheduling and resource allocation. In this paper, we conduct an in-depth evaluation of ILP and CP's capabilities to solve this problem, with several improvements. Moreover, we propose to combine ILP and CP in a tree decomposition with a bounded height. Finally, those methods are combined in a portfolio approach to take advantage from their complementarity.
Fichier principal
Vignette du fichier
article_cpaior_2017_mm.pdf (506.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01447818 , version 1 (27-01-2017)
hal-01447818 , version 2 (02-02-2017)

Identifiants

  • HAL Id : hal-01447818 , version 2

Citer

Maël Minot, Samba Ndojh Ndiaye, Christine Solnon. Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem. International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017), Jun 2017, Padova, Italy. pp.359-375. ⟨hal-01447818v2⟩
333 Consultations
352 Téléchargements

Partager

Gmail Facebook X LinkedIn More