Clik here to view.
Bin packing part 1: Setting a baseline
Some problems can only be solved by brute-forcing every possible combination. The problem with such an approach, is that execution time grows exponentially as the amount of input data grows – so that...
View ArticleClik here to view.
Bin packing part 2: Packing it tighter
In my previous post, I explained the bin packing problem, explained an example scenario, and established a baseline for both speed and efficiency of bin packing algorithms by writing a rather crude...
View ArticleClik here to view.
Bin packing part 3: Need for speed
In the first post of this series, I explained the bin-packing problem and established a baseline solution. The second post investigated ways to increase the packing efficiency. In none of these posts...
View ArticleClik here to view.
Bin packing part 4: The set-based disaster
Almost a year ago now, I started a series of blog post on the bin packing problem. But after the first three posts, various reasons caused the research I still had to do for the fourth part to be...
View ArticleClik here to view.
Bin packing part 5: Set-based iteration
One of the most common techniques authors use to keep their readers interested is to leave them with a cliff-hanger. It’s what I did when I finished part 4 of my series on the bin packing problem –...
View ArticleClik here to view.
Bin packing part 6: Further improvements
In part 5 of my series on the bin packing problem, I presented a method that sits somewhere in between the true row-by-row iterative characteristics of the first three parts and the truly set-based...
View Article