The following publications are possibly variants of this publication:
- On the computational complexity of the Probabilistic Traveling Salesman Problem with DeadlinesDennis Weyland. TCS, 540:156-168, 2014. [doi]
- Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with DeadlinesDennis Weyland. eurocast 2015: 279-285 [doi]
- An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPUDennis Weyland, Roberto Montemanni, Luca Maria Gambardella. eurocast 2013: 332-339 [doi]
- A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlinesDennis Weyland, Roberto Montemanni, Luca Maria Gambardella. jpdc, 73(1):74-85, 2013. [doi]
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo samplingDennis Weyland, Roberto Montemanni, Luca Maria Gambardella. cor, 40(7):1661-1670, 2013. [doi]