Technical Note—An n -Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Kenneth R. Fox, Bezalel Gavish and Stephen C. Graves
Additional contact information
Kenneth R. Fox: Boeing Commercial Airplane Company, Seattle, Washington
Bezalel Gavish: Graduate School of Management, University of Rochester, Rochester, New York
Stephen C. Graves: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1980, vol. 28, issue 4, 1018-1021

Abstract: A new formulation of the time-dependent salesman problem is presented which uses n 3 variables and only n constraints.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.4.1018 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:4:p:1018-1021

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().