Path: utzoo!utgpu!news-server.csri.toronto.edu!eecg.toronto.edu!rjf
Newsgroups: comp.theory
From: rjf@eecg.toronto.edu (Bob Francis)
Subject: Bin Packing
Message-ID: <1991Apr19.095118.3238@jarvis.csri.toronto.edu>
Organization: EECG, University of Toronto
Distribution: na
Date: 19 Apr 91 13:51:19 GMT
Lines: 29

Subject: Bin packing

I am looking for information on bin packing algorithms
that deal with integer sized bins and boxes.

ie.
	Given an integer K, a finite set of boxes

		U = {u_1, u_2, ... u_n}

	and an integer size, s (u_i), 
	between 1 and K for each box u_i in U.

	Parition U into disjoint subsets

		U_1, U_2, ... U_m

	such that the sum of the sizes of the boxes 
	in any subset U_i is less than or equal to K
	and such that m is as small as possible.


In pariticular, I would like to know if dynamic programming
has been applied to this problem.

Please reply by e-mail.

	Bob Francis
	rjf@eecg.toronto.edu