Cargando…
Binary salp swarm algorithm for discounted {0-1} knapsack problem
While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently. The original knapsack problem requires selecting specific items from a...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8989235/ https://www.ncbi.nlm.nih.gov/pubmed/35390109 http://dx.doi.org/10.1371/journal.pone.0266537 |