n the case of the maximum clique problem, the ground set E corresponds to the set of nodes V. The set of feasible solutions F ⊆ 0 E is formed by all subsets of V in which all nodes are pairwise adjacent. 