HN user

adpfr

6 karma
Posts0
Comments9
View on HN
No posts found.

There is a couple of research papers on bin packing with variable bin sizes, e.g. [1, 2]. You can probably find most of them with scholar.google.com, and you might get some more results if you look for "(2d) cutting stock (with) variable stock (sizes)" or for the "(two-dimensional) assortment problem".

In most papers it is assumed that you have a finite set of bins with different, but fixed dimensions to select from (as opposed to your problem, where both dimensions seem to be free). A notable exception is [3] (maybe there are more, but it's the only one I have come across).

There is also quite a lot of literature on the strip packing/cutting problem, which deals with the case of one fixed and one "infinite" dimension.

[1] http://www.sciencedirect.com/science/article/pii/S1572528605...

[2] http://www.sciencedirect.com/science/article/pii/S0305054808...

[3] http://www.tandfonline.com/doi/abs/10.1080/00207540903317523

SEEKING WORK - Germany/remote

I am specialized in operations research consulting (mathematical modeling, optimization, planning and scheduling systems, simulation), but I am also happy to help you with your web app or e-commerce project.

My primary languages of choice are C++, Python (Django) and JavaScript, and I also have a little bit of web front-end development experience (HTML, CSS, jQuery).

For more details, just drop me an email at info@ad-ormc.de.