A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
Jesper NederlofJakub PawlewiczCéline M. F. SwennenhuisKarol WegrzyckiPublished in: SIAM J. Comput. (2023)
Keyphrases
- bin packing
- computational complexity
- assembly line balancing
- memory requirements
- search space
- k means
- cost function
- linear complexity
- learning algorithm
- np hard
- dynamic programming
- packing problem
- space complexity
- search strategy
- simulated annealing
- higher dimensional
- expectation maximization
- particle swarm optimization
- worst case
- state space
- special case
- optimal solution