Lataa...
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...
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Hindawi Limited
2014-01-01
|
| Sarja: | The Scientific World Journal |
| Linkit: | http://dx.doi.org/10.1155/2014/189164 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|