Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem.
Thibaut LustDaniel TuyttensPublished in: TAAI (2013)
Keyphrases
- set covering problem
- pareto local search
- bi objective
- set covering
- integer programming
- branch and bound algorithm
- efficient solutions
- column generation
- multi objective
- multi objective optimization
- integer program
- network design
- ant colony optimization
- multiple objectives
- knapsack problem
- genetic algorithm
- combinatorial optimization
- exact solution
- shortest path problem
- np complete
- genetic programming
- optimization problems
- dynamic programming