Constraint Optimization Problems and Bounded Tree-Width Revisited

@inproceedings{Frnqvist2012ConstraintOP,
  title={Constraint Optimization Problems and Bounded Tree-Width Revisited},
  author={Tommy F{\"a}rnqvist},
  booktitle={CPAIOR},
  year={2012}
}
The valued constraint satisfaction problem (VCSP) is an optimization framework originating from artificial intelligence which generalizes the classical constraint satisfaction problem (CSP). In this paper, we are interested in structural properties that can make problems from the VCSP framework, as well as other CSP variants, solvable tooptimality in polynomial time. So far, the largest structural class that is known to be polynomialtime solvable to optimality is the class of bounded hypertree… CONTINUE READING
6 Citations
33 References
Similar Papers

Similar Papers

Loading similar papers…