Some interesting HARD problems

Each of these problems need some in depth analysis and attention for a grad "theory" student:

Set Cover Problem
Bin Packing Problem
Facility Location Problem
Knapsack Problem
TSP
Hamiltonian Path Problem
Vertex Cover Problem
Partition Problem
Graph Coloring
Steiner Tree