<  Back to the Polytechnique Montréal portal

Traveling salesman problem as a constrained shortest path problem: theory and computational experience

David J. Jr. Houck, Jean-Claude Picard, Maurice Queyranne and Ramakrishna Rao Vemuganti

Technical Report (1978)

[img] Published Version
Terms of Use: All rights reserved.
Restricted to:
Registered users or access from Polytechnique onlyLog in using your matricule if you are not accessing this document from Polytechnique Montréal's buildings or VPN.

Request a copy
Cite this document: Houck, D. J. J., Picard, J.-C., Queyranne, M. & Vemuganti, R. R. (1978). Traveling salesman problem as a constrained shortest path problem: theory and computational experience (Technical Report n° EP-R-78-28).
Show abstract Hide abstract

Abstract

N-Paths and related linear integer programming formulations of TSP -- A linear integer programming formulation of TSP. Another linear integer programming formulation of TSP -- Subgradient optimization -- Branch and bound algorithms -- A tighter relaxation of TSP.

Open Access document in PolyPublie
Department: Département de mathématiques et de génie industriel
Date Deposited: 15 Apr 2021 15:13
Last Modified: 18 Nov 2021 13:45
PolyPublie URL: https://publications.polymtl.ca/5977/
Document issued by the official publisher
Report number: EP-R-78-28

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only