Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- 1 August 1980
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 28 (4) , 1018-1021
- https://doi.org/10.1287/opre.28.4.1018
Abstract
A new formulation of the time-dependent salesman problem is presented which uses n3 variables and only n constraints.Keywords
This publication has 0 references indexed in Scilit: