bin-packing

I have some bins with different capacities and some objects with specified size. The goal is to pack these objects in the bins. Until now it is similar to the bin-packing problem. But the twist is that each object has a partial overlap with another. So while object 1 and 2 has sizes s1 and s2, when I put them in the same bin the filled space is less than s1+s2. Supposing that I know this overlapping value for each pair of objects, is there any approximation algorithm like the ones for original bin-packing for this problem too? Masood_mj The answer is to use a kind of tree that captures the

I'm looking for help with improving an algorithm for placing blocks of odd shapes. My problem domain is odd, but the best analogy for my blocks is Tetris pieces, except that they can have more than four pieces. The blocks still are composed of only right angles, but they can be long and winding, they can branch, etc. I'm trying to arrange multiple large arbitrarily shaped blocks in minimal space (I know, a bin-packing problem) but my current solution looks ugly. I'm basically placing one, then brute forcing the rest by trying to place them at the origin of my grid and then slowly pushing them

As the title already says I need C/C++ sourcecode or a library that I can use to solve the Bin Packing problem with 2D rectangular shapes where the bin is also rectangular and the rectangles are also being rotated by 90° angles to fit better. I already have all required values, so I need no online packing algorithm. I only found a lib that deals with a square bin and without rotation which is not really efficient enough for my needs. I would really appreciate anything C/C++ handling a rectangular bin and rotation. Thanks. PS: The required time for the calculation is not important, only the

Given n bins of infinite capacity, I want to pack m items into them (each with a specific weight), whilst minimizing the weight of the heaviest bin. This isn't a traditional bin packing / knapsack problem where a bin has a finite capacity and you attempt to minimize the amount of bins used; I have a set amount of bins and want to use them all in order to make the heaviest bin's weight as low as possible. Is there a name for this problem? I have looked through a number of papers with key words, but I have found nothing similar. Cheers. If the amount of bins is the constraint, instead of the

I have an optimisation issue. It's about a product that contains 20 parts (the order of producing doesn't matter). I've got 3 similar machine that can produce all 20 parts. I've got the 20 parts represented in minutes (ie. it takes 3min to produce the first part and 75min to produce the second part, etc) ItemTime<-c(3,75,55,12,45,55,11,8,21,16,65,28,84,3,58,46,5,84,8,48) So to produce 1 product it takes 730 min. sum(ItemTime) The aim is to minimise the production of one product by allocating the good item to the three machines. sum(ItemTime/3) So actually I need to be as close as 243.333 min

I was wondering if anyone knows of any algorithms suited to fitting together N number of rectangles of unknown size into the smallest possible containing rectangle. By optimal I mean with reducing the amount of white space left over in the resulting containing rectangle. I would like to use this to generate css sprites from a series of images. Many Thanks, Ian Unreason Through packing images into square texture and Simon 's answer I got to this link http://code.activestate.com/recipes/442299/ I did not check the recipe, but it seems to allow using non-square containers. Grembo I think what you

I'm looking for open source (preferably c++) algorithms for 2d bin packing of rectangular and or irregular shapes. I've found several papers on the subject but no code. Here is the best to my knowledge about rectangular bin packing: http://clb.demon.fi/projects/rectangle-bin-packing 来源： https://stackoverflow.com/questions/143580/where-can-i-find-open-source-2d-bin-packing-algorithms