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
X
X
X
Show Source Code
|
Download Source Code Notebook
"
Optimal Bin Packing with Random Lengths
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/OptimalBinPackingWithRandomLengths/
Contributed by:
Yifan Hu
and
Stephen Wolfram
Algorithms
Approximation Methods
Computer Science
Computers
Numerical Analysis
Optimization
Theory of Computation
Convergence of Minimization Methods
Optimal Transport Scheduling
The Wolfram 2,3 Turing Machine with Random Conditions
Rule Case Transition Diagrams for the Wolfram 2,3 Turing Machine
Causal Networks for the Wolfram 2,3 Turing Machine
Rule Case Fractions in the Wolfram 2,3 Turing Machine
State Sequences in the Wolfram 2,3 Turing Machine
The Wolfram 2,3 Turing Machine Left-Compressed Evolution
Head Motion of the Wolfram 2,3 Turing Machine
The Wolfram 2,3 Turing Machine
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
