Optimal Bin Packing with Random Lengths


	Given a set of blocks of random lengths (shown at the bottom), what is the optimal subset to include in order to achieve a given target length? This Demonstration shows the subsets that minimize the difference between actual and target length.


	Contributed by: Yifan Hu and Stephen Wolfram

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

RSS

Atom