A two-phase algorithm for the biobjective integer minimum cost flow problem.

Andrea Raith Matthias Ehrgott

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

Keyphrases

minimum cost flow
bi objective
dynamic programming
objective function
optimization algorithm
shortest path problem
knapsack problem
cost function
optimal solution
worst case
simulated annealing
combinatorial optimization
search space
computational complexity
np hard
shortest path
search procedure
test problems