Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach.
Andrea RaithAntonio Sedeño-NodaPublished in: Comput. Oper. Res. (2017)
Keyphrases
- bi objective
- efficient solutions
- network flow problem
- multi objective
- set covering problem
- network design
- multiple objectives
- multi objective optimization
- network design problem
- minimum cost flow
- ant colony optimization
- shortest path problem
- routing problem
- minimal cost
- network flow
- minimum cost
- knapsack problem
- optimal solution
- solution quality
- combinatorial optimization problems
- neural network
- shortest path
- linear programming
- special case