An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.
Ei AndoShuji KijimaPublished in: Algorithmica (2016)
Keyphrases
- packing problem
- knapsack problem
- efficient computation
- dynamic programming
- exact computation
- image processing
- approximation algorithms
- pre computed
- convex hull
- genetic algorithm
- special case
- optimal solution
- integer programming
- artificial intelligence
- numerical integration
- real time
- timed automata
- convolution kernel