Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint.

Tan Tran Canh Pham Dung Ha

Published in: SoICT (2023)

Keyphrases

dynamic programming
greedy algorithm
knapsack problem
real world
objective function
penalty function
databases
upper bound
linear constraints
newly defined
real time
data mining
genetic algorithm
computational complexity
high order
constraint solving