---
title: "An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem"
authors:
  - "Ho Soo Lee"
  - "Mark Trumbo"
doi: ""
url: "https://ijcai.org/proceedings/1997/202"
pdf: "https://ijcai.org/proceedings/1997/0202.pdf"
venue: "Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence"
year: 1997
pages: "1402-1410"
track: "Search"
keywords:
---

# An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem

Ho Soo Lee, Mark Trumbo

*Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence*, pages 1402-1410.

## 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.