Why is the fact that it is NP-hard a fundamental problem for real-world systems? Sure, it is hard to solve in the mathematical sense, but in the real world it appears as though approximate algorithms for practically all well-known NP-hard problems exist (check wiki pages), and are very effective and efficient.