How might you obtain such a bound?
Example: looking for a maximum clique.
Formulate problem as integer linear programming problem.
N variables x1,…. xn corresponding to vertices
- xi = 1 if node vi is in maximum clique, 0 otherwise
Constraints: xi + xj <= 1 for each pair of vertices such that (vi , vj) NOT an edge; xi in {0,1} for every i
Objective Function: maximize