Cargando…
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost s...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi Publishing Corporation
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4030563/ https://www.ncbi.nlm.nih.gov/pubmed/24883356 http://dx.doi.org/10.1155/2014/189164 |