@inproceedings{c4179dfcee564990b0a1c2b9215021ab,

title = "A binary firefly algorithm for the set covering problem",

abstract = "The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.",

keywords = "Binary firefly algorithm, Metaheuristic, Set covering problem",

author = "{CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Miguel Olivares-Su{\'a}rez and Fernando Paredes",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-06740-7_6",

language = "English",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "65--73",

editor = "Radek Silhavy and Roman Senkerik and Oplatkova, {Zuzana Kominkova} and Petr Silhavy and Zdenka Prokopova",

booktitle = "Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014",

note = "null ; Conference date: 01-04-2014",

}