An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem.
Wenqi HuangZhanghua FuRuchu XuPublished in: EMEIT (2011)
Keyphrases
- packing problem
- learning algorithm
- detection algorithm
- bin packing
- computational complexity
- computationally efficient
- np hard
- dynamic programming
- similarity measure
- lower bound
- expectation maximization
- combinatorial optimization
- dc programming
- gradient projection
- arbitrary shaped
- convergence rate
- matching algorithm
- ant colony optimization
- feature selection