A minmax regret version of the time-dependent shortest path problem.

Eduardo Conde Marina Leal Justo Puerto

Published in: Eur. J. Oper. Res. (2018)

Keyphrases

interval data
shortest path problem
minmax regret
shortest path
single source
combinatorial optimization problems
multiple objectives
directed graph
directed acyclic graph
data clustering
unsupervised learning
genetic programming