Search Results for author:
Found 3 papers, 0 papers with code
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while satisfying the knapsack capacity.
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
As the counterpart problem of SUKP, however, BMCP was introduced early in 1999 but since then it has been rarely studied, especially there is no practical algorithm proposed.
Iterated two-phase local search for the Set-Union Knapsack Problem
The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
