Strong consistencies for weighted constraint satisfaction problems

Abstract

This thesis focuses on strong local consistencies for solving optimization problems in Cost Function Networks (aka weighted constraint networks). These methods provide the lower bound necessary for Branch-and-Bound search. We first study Virtual arc consistency (VAC), one of the strongest soft arc consistencies for Cost Function Networks, which is enforced… (More)
DOI: 10.1007/s10601-015-9208-8

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics