Determining time-dependent minimum cost paths under several objectives.

Hamza Heni Leandro C. Coelho Jacques Renaud

Published in: Comput. Oper. Res. (2019)

Keyphrases

minimum cost
np hard
network flow problem
approximation algorithms
spanning tree
minimum cost path
network flow
capacity constraints
shortest path
network simplex algorithm
edit operations
minimum cost flow
travel time
integer programming
knapsack problem
genetic algorithm
undirected graph
worst case