Solving Set Covering Problem Using Simulated Annealing
ŠEDA, P. HOŠEK, J.
Set Covering Problem is one of the most interesting problems of the current research. This work is solving the special version of set covering problem which includes the distances between service centres (hospitals, telecommunication devices, schools etc.) and customer locations (user devices, patients, schoolchildren).
set covering problem, simulated annealing
Kanceláři SE5.124, Technická 12, 616 00 Brno