Limitations Linear programs can take a long time to solve –Exponentially many cliques and independent sets –Especially when single path routing is used There is no guarantee that optimal solution will be found in less than exponential time Upper bound might not converge to optimal even if we find all cliques –Graphs with odd-holes and anti-holes
{}