An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

• 1 April 1995
• journal article
• Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
• Vol. 43  (2) , 367-371
• https://doi.org/10.1287/opre.43.2.367

Abstract

Keywords

• TIME WINDOWS
• OPTIMAL
• ALGORITHM
• SOLVING
• NODES
• SALESMAN
• TRAVELING
• PROBLEM SIZE