EXACT AND HEURISTIC PROCEDURES FOR THE TRAVELING SALESMAN PROBLEM WITH PRECEDENCE CONSTRAINTS, BASED ON DYNAMIC-PROGRAMMING