On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines

Dennis Weyland. On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines. Theoretical Computer Science, 540:156-168, 2014. [doi]

Abstract

Abstract is missing.