Category: Cited by 1st review
Technical Note—An n -Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
A new formulation of the time-dependent salesman problem is presented which uses n 3 variables and only n constraints.
TIME-DEPENDENT TRAVELING SALESMAN PROBLEM AND ITS APPLICATION TO THE TARDINESS PROBLEM IN ONE-MACHINE SCHEDULING.
The time-dependent traveling salesman problem may be stated as a scheduling problem in which n jobs have to be processed at minimum cost on a single machine. The set-up cost associated with each job depends not only on the job …