The maximum common subgraph problem is an NP-hard problem which is very difficult to solve with exact approaches. To speed up the solution process, we may decompose it into independent subproblems… (More)

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… (More)

The Minimum 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… (More)

The objective of this thesis is, from a general standpoint, to design and evaluate decomposition methods for solving constrained optimisation problems. Two optimisation problems in particular are… (More)