The problem has been shown to be NP-hard
the decision problem version ("given the costs and a number x, decide whether there is a round-trip route cheaper than x") is NP-complete.
How can the "non-decision problem" version be NP-hard? Doesn't this class contain decision problems, by definition? Is this some sort of abuse of notation? Are they just being overly flexible with the definition of NP-hard?