Table of Contents
ISRN Operations Research
Volume 2013, Article ID 203032, 10 pages
http://dx.doi.org/10.1155/2013/203032
Research Article

A New Formulation of the Set Covering Problem for Metaheuristic Approaches

École Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, QC, Canada H3C 3A7

Received 18 February 2013; Accepted 4 April 2013

Academic Editors: L. Buzna, P. Ekel, C. Mohan, and M. Wang

Copyright © 2013 Nehme Bilal et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Nehme Bilal, Philippe Galinier, and Francois Guibault, “A New Formulation of the Set Covering Problem for Metaheuristic Approaches,” ISRN Operations Research, vol. 2013, Article ID 203032, 10 pages, 2013. https://doi.org/10.1155/2013/203032.