Comment by lambdaone

Just because a problem is NP-complete doesn't mean it's infeasible to produce "good enough" approximate solutions. The traveling salesman problem is a great example of this.