Hardest problems in NP are NP-complete
Provably NP-complete problems --
If any one can be solved in polynomial time, then all of them can.
Right now, no known efficient algorithm known. Biggest open problem in CS:
Heuristics/approximation algorithms typically used. Sometimes solved exactly too -- depends on the application area.