Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution.

Karl Bringmann Alejandro Cassis

Published in: CoRR (2023)

Keyphrases

knapsack problem
image processing
dynamic programming
convex hull
feasible solution
upper bound
convex optimization
piecewise linear
packing problem
memory efficient
convexity properties
data sets
convolution kernel
linear filtering
globally optimal
linear programming
genetic algorithm