I've once had a homework problem where I was supposed to use some kind of optimization algorithm to solve the knapsack problem. The teacher said that, while it's technically NP complete, you can generally solve it pretty easily. Although the homework did it with such a small problem that the algorithm pretty much came down to checking every combination.