0
votes
0answers
42 views

1D bin packing solution with NMinimize or NMaximize (use minimal office space) [on hold]

I want to use NMinimize to solve a 1D bin packing problem. The goal is to assign a large number of staff to as few rooms as possible. The empty rooms can then be sub-let and generate income. Hence ...
6
votes
2answers
591 views

Distribution of 10 points within a unit square

Related to some packing problems, following problem arose: Distribute 10 points within a square of sides 1, so that minimal distance between them is maximized. With the help of random simulation, or ...
5
votes
1answer
393 views

Packing squares into a circle

I am currently trying to solve and understand a problem about packing the maximum of squares into a circle. What I am trying to do, is to calculate the maximum number of variable sized squares (with ...
8
votes
1answer
241 views

Efficiently filling area with disks located at certain points

Starting from a set of points, I want to fill an area using disks. Each disk's center should be one of the points and the disks should not overlap. I've managed to write a function that, given a list ...