Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.
Ilias DiakonikolasMihalis YannakakisPublished in: SIAM J. Comput. (2009)
Keyphrases
- minimum cost flow
- shortest path
- bi objective
- shortest path problem
- shortest path algorithm
- multi objective
- efficient solutions
- minimum cost
- road network
- set covering problem
- multi objective optimization
- multiple objectives
- optimization algorithm
- routing algorithm
- combinatorial optimization problems
- exact solution
- np complete
- optimization problems
- genetic algorithm