Bound sets for biobjective combinatorial optimization problems.
Matthias EhrgottXavier GandibleuxPublished in: Comput. Oper. Res. (2007)
Keyphrases
- combinatorial optimization problems
- bi objective
- shortest path problem
- ant colony optimization
- knapsack problem
- metaheuristic
- optimization problems
- combinatorial optimization
- minimum cost flow
- traveling salesman problem
- efficient solutions
- lower bound
- set covering problem
- upper bound
- interval data
- optimal solution
- job shop scheduling problem
- dynamic programming
- particle swarm optimization
- multiple objectives
- worst case
- vehicle routing problem
- exact algorithms
- multi objective
- genetic algorithm
- search space
- network design
- nsga ii
- test problems
- special case