A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit.
Walter KnödelPublished in: MFCS (1981)
Keyphrases
- bin packing
- worst case
- computational complexity
- cost function
- dynamic programming
- objective function
- space complexity
- k means
- detection algorithm
- simulated annealing
- monte carlo
- memory requirements
- learning algorithm
- nearest neighbor
- expectation maximization
- ant colony optimization
- traveling salesman problem
- search space
- packing problem