binpack 0.1.0

solve binpacking problems using Linear Programming
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

# Diabolically tight constraints
bins:
  b1: 7
  b2: 9
  b3: 11
  b4: 13
  b5: 9
items:
  i1:
    quantity: 12
    groupSize: 6
    affinity:
      soft:
        - weight: 2
          bins: [b1, b2]
  i2:
    quantity: 15
    groupSize: 5
    affinity:
      soft:
        - weight: 2
          bins: [b3, b4]
  i3:
    quantity: 16
    groupSize: 4
    affinity:
      soft:
        - weight: 1
          bins: [b4, b5]
  i4:
    quantity: 5
    groupSize: 5
    antiAffinity:
      soft:
        - weight: 1
          bins: [b1, b2, b3]
solution:
  i1:
    b1: 6
    b3: 6
  i2:
    b2: 5
    b3: 5
    b4: 5
  i3:
    b2: 4
    b4: 8
    b5: 4
  i4:
    b5: 5