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

AI Assistant Blog Pricing

Open Access

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

Author(s) -

Maël Minot,

Samba Ndiaye,

Christine Sol

Publication year - 2016

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

Subject(s) - integer programming , decomposition , mathematical optimization , computer science , scheduling (production processes) , linear programming , bounded function , graph , constraint programming , mathematics , combinatorics , mathematical analysis , ecology , stochastic programming , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.