Absolutely true in the real world; I was part of a real team that explored quantum optimization algorithms as part of a strategic initiative (my day job is algorithmic optimization on classical computers).

Our problem is similar (but not identical) to the traveling salesman problem. We run on a tight time constraint (measured in days for the complex type and measured in minutes for the simple type).

We're running approximations on classic computers but estimate that we'd save billions if we could reach optimum.