A penalized best-response algorithm for nonlinear single-path routing problems.

Olivier Brun Balakrishna J. Prabhu Josselin Vallet

Published in: Networks (2017)

Keyphrases

routing problem
cost function
dynamic programming
worst case
real time
computational complexity
neural network
optimal solution
search algorithm
np hard
linear programming
ant colony optimization
benchmark problems
depth first search