 :If JSP is defined for arbitrary object function, as in the article, then JSP is  NP-hard wihtout any references to TSP. You must try all permutations from n!. But it is triviality. Thank you for references to p.s. of JSP.   