3 papers
cs.CC2025
An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
Yang Yang
Dembo-Hammer's Reduction Algorithm (DHR) is one of the classical algorithms for the 0-1 Knapsack Problem (0-1 KP) and its variants, which reduces an instance of the 0-1 KP to a sub…
cs.DS2024
A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
Yang Yang
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range , and these instances can be referred…
cs.NE2024
An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem
Yang Yang
As an important part of genetic algorithms (GAs), mutation operators is widely used in evolutionary algorithms to solve -hard problems because it can increase the pop…