An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem
Abstract
This paper describes a constrained bin-packing •problem (CBPP) and an approximate, anytime algorithm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algorithm for CBPP uses a heuristic search for labeling edges with a binary value, together with a beam search and constraint propagation. Some experimental results are provided. This algorithm has been successfully applied to industrial-scale scheduling problems. 1
Cite
Text
Lee and Trumbo. "An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem." International Joint Conference on Artificial Intelligence, 1997.Markdown
[Lee and Trumbo. "An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem." International Joint Conference on Artificial Intelligence, 1997.](https://mlanthology.org/ijcai/1997/lee1997ijcai-approximate/)BibTeX
@inproceedings{lee1997ijcai-approximate,
title = {{An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem}},
author = {Lee, Ho Soo and Trumbo, Mark},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1997},
pages = {1402-1411},
url = {https://mlanthology.org/ijcai/1997/lee1997ijcai-approximate/}
}