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...

Descrizione completa

Dettagli Bibliografici

Autore principale:	Yang Yang
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2024-06-01
Serie:	Mathematics
Soggetti:	unbounded knapsack problem with bounded coefficients dynamic programming branch and bound linear Diophantine equation Frobenius problem all-capacities unbounded knapsack problem
Accesso online:	https://www.mdpi.com/2227-7390/12/12/1878
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!