An algorithm for the biobjective integer minimum cost flow problem.
Antonio Sedeño-NodaCarlos González-MartínPublished in: Comput. Oper. Res. (2001)
Keyphrases
- bi objective
- minimum cost flow
- shortest path problem
- optimization algorithm
- cost function
- computational complexity
- benchmark problems
- np hard
- evolutionary algorithm
- search space
- neural network
- simulated annealing
- particle swarm optimization
- dynamic programming
- shortest path
- ant colony optimization
- computational efficiency
- differential evolution
- hybrid algorithm
- solution quality
- efficient solutions
- maximum flow