The biobjective undirected two-commodity minimum cost flow problem.

Antonio Sedeño-Noda Carlos González-Martín Jose Gutiérrez

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

Keyphrases

bi objective
efficient solutions
multi objective
minimum cost flow
multi objective optimization
multiple objectives
set covering problem
ant colony optimization
directed graph
network design
shortest path problem
weighted graph
knapsack problem
nsga ii
evolutionary algorithm
routing problem
shortest path algorithm