The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm.
Anthony PrzybylskiXavier GandibleuxMatthias EhrgottPublished in: Comput. Oper. Res. (2006)
Keyphrases
- minimum cost flow
- dynamic programming
- bi objective
- shortest path problem
- search space
- linear programming
- np hard
- simulated annealing
- optimization algorithm
- computational efficiency
- particle swarm optimization
- efficient solutions
- hybrid algorithm
- knapsack problem
- combinatorial optimization
- genetic algorithm
- cost function
- optimal solution
- objective function