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

DOI10.1007/978-3-319-59776-8_29zbMath1489.68255OpenAlexW2618773733MaRDI QIDQ2011610

Christine Solnon, Samba Ndojh Ndiaye, Maël Minot

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_29

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• CPLEX
• Choco
• Gecode
• SATzilla
• llama

Cites Work

• Unnamed Item
• Unnamed Item
• A memetic algorithm for the minimum sum coloring problem
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Hybrid evolutionary search for the minimum sum coloring problem of graphs
• An effective heuristic algorithm for sum coloring of graphs
• Lower Bounds for the Minimal Sum Coloring Problem
• Graph minors. II. Algorithmic aspects of tree-width
• Tight bounds on the chromatic sum of a connected graph
• Graph Colorings
• Algorithm portfolios