TY  - JOUR
AU  - Gonzalez-Pardo, Antonio
AU  - Del Ser, Javier
AU  - Camacho, David
PY  - 2017
DO  - 10.1016/j.asoc.2017.06.042
SN  - 1568-4946
UR  - https://hdl.handle.net/11556/3769
AB  - Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group of variables where a set of...
LA  - eng
TI  - Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
TY  - journal article
ER  -