An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range <i>R</i>, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solv...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
MDPI AG
2024-06-01
|
| Col·lecció: | Mathematics |
| Matèries: | |
| Accés en línia: | https://www.mdpi.com/2227-7390/12/12/1878 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|