Combinatorial optimization problem
Combinatorial opt. problem is a tuple (V, f, c)
V is a set of discrete variables with finite domains
Assignment maps each v ? V to value domain
f is a function that decides feasibility of assignments
- f(a) returns true if and only if assignment a is feasible
c is a function that returns the cost of an assignment
- c(a) is the cost of assignment a
- a1 is preferred over assignment a2 if c (a1) < c(a2)