We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...