Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Computers and Operations Research
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A new algorithm for optimal bin packing
Eighteenth national conference on Artificial intelligence
An improved algorithm for optimal bin packing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An exact algorithm for the dual bin packing problem
Operations Research Letters
Search strategies for optimal multi-way number partitioning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
Bin-completion, a bin-oriented branch-and-bound approach, was recently shown to be promising for the bin packing problem. We propose several improvements to bin-completion that significantly improves search efficiency. We also show the generality of bin-completion for packing and covering problems involving multiple containers, and present bin-completion algorithms for the multiple knapsack, bin covering, and min-cost covering (liquid loading) problems that significantly outperform the previous state of the art. However, we show that for the bin packing problem, bin-completion is not competitive with the state of the art solver.