A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational results on benchmark instances from the literature show the effectiveness of the proposed approach.
A metaheuristic approach for the set covering problem
TOTH, PAOLO;
2009
Abstract
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational results on benchmark instances from the literature show the effectiveness of the proposed approach.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
