<  Back to the Polytechnique Montréal portal

Time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling

Jean-Claude Picard, Maurice Queyranne

Technical Report (1977)

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 (17MB)
Show abstract
Hide abstract

Abstract

The time-dependent traveling salesman problem -- Integer programming formulations -- Multipartite networks -- Shortest paths -- Another integer programming formulation -- A dual problem -- Dominance test -- The precedence relation -- Computational results.
Department: Department of Mathematics and Industrial Engineering
PolyPublie URL: https://publications.polymtl.ca/6094/
Report number: EP-R-77-12
Date Deposited: 15 Apr 2021 15:13
Last Modified: 11 Nov 2022 14:17
Cite in APA 7: Picard, J.-C., & Queyranne, M. (1977). Time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling (Technical Report n° EP-R-77-12). https://publications.polymtl.ca/6094/

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only

View Item View Item