Optimal Bin Packing with Random Lengths

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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 (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send