Bin-Completion Algorithms for Multicontainer Packing and Covering Problems
Abstract
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.
Cite
Text
Fukunaga and Korf. "Bin-Completion Algorithms for Multicontainer Packing and Covering Problems." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Fukunaga and Korf. "Bin-Completion Algorithms for Multicontainer Packing and Covering Problems." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/fukunaga2005ijcai-bin/)BibTeX
@inproceedings{fukunaga2005ijcai-bin,
title = {{Bin-Completion Algorithms for Multicontainer Packing and Covering Problems}},
author = {Fukunaga, Alex S. and Korf, Richard E.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {117-124},
url = {https://mlanthology.org/ijcai/2005/fukunaga2005ijcai-bin/}
}