Cargando…
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous dynamic optimization problems although the majorit...
Autores principales: | Wu, Husheng, Xiao, Renbin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
AAAS
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7049380/ https://www.ncbi.nlm.nih.gov/pubmed/32159160 http://dx.doi.org/10.34133/2020/1762107 |
Ejemplares similares
-
Knapsack problems
por: Kellerer, Hans, et al.
Publicado: (2004) -
An improved Wolf pack algorithm for optimization problems: Design and evaluation
por: Chen, Xuan, et al.
Publicado: (2021) -
Correction to: The Knapsack Problem with Forfeits
por: Cerulli, Raffaele, et al.
Publicado: (2020) -
Binary salp swarm algorithm for discounted {0-1} knapsack problem
por: Dang, Binh Thanh, et al.
Publicado: (2022) -
Exact solution of the robust knapsack problem()
por: Monaci, Michele, et al.
Publicado: (2013)