A comparison of algorithm RS with algorithm OPTSOL70 We recently proposed a new Lagrangian surrogate heuristic, called RS, for solving the location (or unicost) set covering problem [Eur. J. Oper. Res. 100, 586--593 (1997)]. Here, 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 RS with the best designed hybrid algorithm for the location set covering problem, known as OPTSOL70.
Keywords for this software
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.