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

Full description

Bibliographic Details

Published in:	Mathematics
Main Author:	Yang Yang
Format:	Article
Language:	English
Published:	MDPI AG 2024-06-01
Subjects:	unbounded knapsack problem with bounded coefficients dynamic programming branch and bound linear Diophantine equation Frobenius problem all-capacities unbounded knapsack problem
Online Access:	https://www.mdpi.com/2227-7390/12/12/1878