May 10, 2009 · I want to pack a list of words into a buffer, keeping track of the starting position and length of each word. The trick is that I'd like to pack the buffer efficiently by eliminating the …

For an application I'm working on I need something like a packing algorithm implemented in Python see here for more details. The basic idea is that I have n objects of varying sizes that I …

Mar 4, 2014 · Which algorithm should I use? This is called the Bin Packing Problem and is NP-hard, so there is not a simple algorithm to solve it.

Dec 17, 2018 · I have spent some time researching 2d bin packing algorithm. I have no extensive experience in algorithm especially in advanced math but I can code :) The perfect example of …

May 7, 2014 · I'm looking for an algorithm to determine the LEAST amount of boxes to package the items into. So far, I've explored the knapsack problem, and although it can come close, I'm …

Mar 10, 2020 · Rectangle packing thread on Stack Overflow – Another fascinating thread on stack overflow this time. Fast Optimizing Rectangle Packing Algorithm for Building CSS Sprites – …

3 days ago · This kind of problem is called the '1D bin packing problem'. You have three bins and each has a capacity of 1/3 the total load, and loads, or items, that need to be packed into this …

Oct 12, 2022 · First, solve the bin packing problem without regard to fairness. Once you know the minimum number of bins to use, add a constraint limiting you to that many bins, change the …

Is there any greedy solution with an approximation bound for the bin-packing problem when we have bins of different size? More formally, there are $n$ bins of size $b_i$ for $i=1,\dotsc,n$, …

Sep 29, 2021 · I have come up with the following greedy algorithm: for every weight $w_i$ in $W$, store it in the first bin available that is compatible with the restrictions given. For …