Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics - Combinatorial Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
Bin completion algorithms for multicontainer packing, knapsack, and covering problems
Journal of Artificial Intelligence Research
An improved algorithm for optimal bin packing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Bin-completion algorithms for multicontainer packing and covering problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adaptive input admission and management for parallel stream processing
Proceedings of the 7th ACM international conference on Distributed event-based systems
Improved bin completion for optimal bin packing and number partitioning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We consider the NP-complete problem of bin packing. Given a set of numbers, and a set of bins of fixed capacity, find the minimum number of bins needed to contain all the numbers, such that the sum of the numbers assigned to each bin does not exceed the bin capacity. We present a new algorithm for optimal bin packing. Rather than considering the different bins that each number can be placed into, we consider the different ways in which each bin can be packed. Our algorithm appears to be asymptotically faster than the best existing optimal algorithm, and runs more that a thousand times faster on problems with 60 numbers.