{"type":"ScholarlyArticle","title":"Bin-Completion Algorithms for Multicontainer Packing and Covering Problems","authors":[{"name":"Alex S. Fukunaga","slug":"alex-s-fukunaga","given":"Alex S.","family":"Fukunaga","affiliation":""},{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/103","pdf":"https://ijcai.org/proceedings/2005/0103.pdf","markdown":"https://ijcai.org/proceedings/2005/103.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/103","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":103,"pages":{"first":117,"last":123},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}