The max-sum labeling problem, defined as maximizing a sum of binary (ie, pairwise)
functions of discrete variables, is a general NP-hard optimization problem with many …

Network design problems (NDP) consist of identifying an optimal subgraph of a graph,
subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and …

We give an algorithm that, given an-vertex graph and an integer, in time either outputs a tree
decomposition of of width at most or determines that the treewidth of is larger than. This is …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …

There are many graph problems that can be solved in linear or polynomial time with a
dynamic programming algorithm when the input graph has bounded treewidth. For …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …

In this paper a Branch-and-Cut algorithm, based on a formulation previously introduced by
us, is proposed for the Graph Coloring Problem. Since colors are indistinguishable in graph …

The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem
defined by a network of local cost functions defined over discrete variables. It has …

Treewidth is a graph parameter with several interesting theoretical and practical
applications. This survey reviews algorithmic results on determining the treewidth of a given …