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.

https://doi.org/10.1287/opre.28.4.1018

Cite as:

@article{Fox_1980,
	doi = {10.1287/opre.28.4.1018},
	url = {https://doi.org/10.1287%2Fopre.28.4.1018},
	year = 1980,
	month = {aug},
	publisher = {Institute for Operations Research and the Management Sciences ({INFORMS})},
	volume = {28},
	number = {4},
	pages = {1018--1021},
	author = {Kenneth R. Fox and Bezalel Gavish and Stephen C. Graves},
	title = {Technical Note{textemdash}An $less$i$greater$n$less$/i$greater$-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem},
	journal = {Operations Research}
}