TY  - JOUR 
AU  - Ferreira, Alexandre Silvestre
AU  - Pozo, Aurora
AU  - Gonçalves, Richard Aderbal
PY  - 2015
SN  - 2255-2863
UR  - http://hdl.handle.net/10366/127627
AB  - The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the...
LA  - eng
PB  - Ediciones Universidad de Salamanca (España)
KW  - Computación
KW  - Informática
KW  - Computing
KW  - Information Technology
TI  - An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
ER  -