A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice.
Suning GongQingqin NongShuyu BaoQizhi FangDing-Zhu DuPublished in: J. Glob. Optim. (2023)
Keyphrases
- learning algorithm
- dynamic programming
- times faster
- significant improvement
- objective function
- cost function
- experimental evaluation
- computational complexity
- preprocessing
- optimal solution
- np hard
- upper bound
- search space
- lattice structure
- improved algorithm
- combinatorial optimization
- simulated annealing
- neural network
- detection algorithm
- clustering method
- matching algorithm
- expectation maximization
- particle swarm optimization
- knapsack problem
- integer programming
- packing problem
- k means
- relaxation algorithm
- minimum cost flow