Some people say yes, as the time complexity is N!, while some researchers claim that there are some polynomial time algorithms such as: http://dl.acm.org/citation.cfm?id=101343
Same thing applies for the assignment problem, if it is NP hard then what about the Hungarian method which runs in O(n^3) time?
If both NP hard and there are some polynomial time algorithms to solve em then P=NP?