{"type":"ScholarlyArticle","title":"An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem","authors":[{"name":"Ho Soo Lee","slug":"ho-soo-lee","given":"Ho Soo","family":"Lee","affiliation":""},{"name":"Mark Trumbo","slug":"mark-trumbo","given":"Mark","family":"Trumbo","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1997/202","pdf":"https://ijcai.org/proceedings/1997/0202.pdf","markdown":"https://ijcai.org/proceedings/1997/202.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/202","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search","track":"Search","number":202,"pages":{"first":1402,"last":1410},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}