A GRASP algorithm to solve the unicost set covering problem.
Joaquín BautistaJordi PereiraPublished in: Comput. Oper. Res. (2007)
Keyphrases
- set covering problem
- set covering
- branch and bound algorithm
- cost function
- np hard
- computational efficiency
- integer programming
- test problems
- worst case
- column generation
- exact solution
- dynamic programming
- particle swarm optimization
- ant colony optimization
- neural network
- upper bound
- shortest path problem
- bi objective
- objective function