A comparison of solution strategies for biobjective shortest path problems.
Andrea RaithMatthias EhrgottPublished in: Comput. Oper. Res. (2009)
Keyphrases
- shortest path problem
- bi objective
- shortest path
- efficient solutions
- multiple objectives
- combinatorial optimization problems
- minimum cost flow
- set covering problem
- multi objective
- multi objective optimization
- ant colony optimization
- directed acyclic graph
- knapsack problem
- directed graph
- integer programming
- search strategy
- traveling salesman problem
- neural network