Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines.

Dennis Weyland Roberto Montemanni Luca Maria Gambardella

Published in: ISCO (2012)

Keyphrases

computational complexity
phase transition
response time
information theoretic
np complete
learning theory
digital libraries
worst case
np hard
database transactions
timing constraints
data sets
neural network
data model
multi agent
feature selection
information retrieval