<  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)

Open Acess document in PolyPublie and at official publisher
[img]
Preview
Open Access to the full text of this document
Published Version
Terms of Use: All rights reserved
Download (12MB)
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.

Additional Information: Ce travail a également été publié dans: Houck, D., Picard, J., Queyranne, M., Vemuganti, R. (1980). The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch, 17 (2 & 3), 93-109.
Department: Department of Mathematics and Industrial Engineering
PolyPublie URL: https://publications.polymtl.ca/5977/
Report number: EP-R-78-28
Date Deposited: 15 Apr 2021 15:13
Last Modified: 09 Apr 2024 17:08
Cite in APA 7: 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). https://publications.polymtl.ca/5977/

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only

View Item View Item