A fast approximation algorithm for solving the complete set packing problem.
Tri-Dung NguyenPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- packing problem
- dc programming
- bin packing
- input data
- approximation ratio
- combinatorial optimization
- optimal solution
- initial set
- learning algorithm
- matching algorithm
- convex hull
- search space
- computational complexity
- objective function
- error tolerance
- arbitrary shaped
- feature extraction
- image compression
- dynamic programming
- np hard
- k means
- np complete
- knapsack problem
- high efficiency
- expectation maximization
- convex functions
- simulated annealing
- reinforcement learning