论文信息 - Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem - 字舞流文

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 n3 variables and only n constraints.

Stephen C. Graves | Bezalel Gavish | Kenneth R. Fox | S. Graves | B. Gavish | K. Fox

[1] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2] E. H. Bowman. Production Scheduling by the Transportation Method of Linear Programming , 1956 .

[3] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .

[4] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..