Partition-Based Lower Bound for Max-CSP.

Javier Larrosa Pedro Meseguer

Published in: CP (1999)

Keyphrases

max csp
lower bound
upper bound
branch and bound algorithm
arc consistency
constraint satisfaction

branch and bound
lower and upper bounds
np hard
objective function
constraint satisfaction problems
constraint networks

polynomial approximation
optimisation problems
optimal solution
np complete
worst case

soft constraints
contextual information
multi objective
linear programming relaxation
sufficiently accurate