Using CP and ILP with tree decomposition to solve the sum colouring problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Using CP and ILP with tree decomposition to solve the sum colouring problem

Utilisation de la programmation par contraintes et de la programmation linéaire avec la décomposition arborescente pour résoudre le problème de somme coloration

Résumé

The Minimum Sum Colouring Problem is an N P-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. Mainly incomplete approaches were proposed, but Integer Linear Programming (ILP) and Constraint Programming (CP) have also been used. In this paper, we conduct a more in-depth evaluation of ILP and CP's capabilities to solve the sum colouring problem, with several improvements. Moreover, we propose to combine ILP and CP in a tree decomposition with a bounded height.
Fichier principal
Vignette du fichier
cp_2016_mm.pdf (410.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01366291 , version 1 (14-09-2016)

Identifiants

  • HAL Id : hal-01366291 , version 1

Citer

Maël Minot, Samba Ndojh Ndiaye, Christine Solnon. Using CP and ILP with tree decomposition to solve the sum colouring problem. Doctoral program of 22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), Sep 2016, Toulouse, France. pp.1-10. ⟨hal-01366291⟩
168 Consultations
215 Téléchargements

Partager

Gmail Facebook X LinkedIn More