<  Back to the Polytechnique Montréal portal

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

Jean-Claude Picard and Maurice Queyranne

Technical Report (1976)

[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: Picard, J.-C. & Queyranne, M. (1976). Time-dependent traveling salesman problem and application to the tardiness problem in one-machine scheduling (Technical Report n° EP-R-76-14).
Show abstract Hide abstract

Abstract

Shortest path approach -- Subgradient optimization -- Branch and bound structures -- Dominance test -- TDTSP formulation -- Branch and bound -- The weighted tardiness problem.

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: 15 Jul 2021 17:02
PolyPublie URL: https://publications.polymtl.ca/6091/
Document issued by the official publisher
Report number: EP-R-76-14

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only