Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
type: Item
instance of: scholarly article
title: Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
zbMATH Open document ID: 1489.68255
DOI: 10.1007/978-3-319-59776-8_29
author: Maël Minot
author: Samba Ndojh Ndiaye
author: Christine Solnon
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6756599
describes a project that uses: Gecode
describes a project that uses: SATzilla
describes a project that uses: Choco
describes a project that uses: llama
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: 978-3-319-59776-8 29
OpenAlex ID: W2618773733
cites work: Q3457209
cites work: Algorithm portfolios
cites work: Hybrid backtracking bounded by tree-decomposition of constraint networks
cites work: Hybrid evolutionary search for the minimum sum coloring problem of graphs
cites work: A memetic algorithm for the minimum sum coloring problem
cites work: Graph Colorings
cites work: Lower bounds for the minimal sum coloring problem
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Tight bounds on the chromatic sum of a connected graph
cites work: An effective heuristic algorithm for sum coloring of graphs
cites work: Q3624141
description: scientific article; zbMATH DE number 6756599