| Article ID: | iaor2002565 |
| Country: | Spain |
| Volume: | 5 |
| Issue: | 2 |
| Start Page Number: | 213 |
| End Page Number: | 220 |
| Publication Date: | Jul 1997 |
| Journal: | TOP |
| Authors: | Pastor Jess T., Almiana Marc |
| Keywords: | set covering |
In a very recent paper we proposed a new lagrangian surrogate heuristic, called RS, for solving the location (or unicost) set covering problem. In that paper we show that RS is more accurate than the pair of greedy type heuristics FMC/CMA and that RS outperforms the surrogate heuristic SH. Here we are going to compare algorithms RS with the best designed hybrid algorithm for the location set covering problem, known as OPTSOL70.