Loading...
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...
Na minha lista:
| Main Authors: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Hindawi Publishing Corporation
2014
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4030563/ https://ncbi.nlm.nih.gov/pubmed/24883356 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/189164 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|