| G2c1: | Zero/one | (1 routine) |
| G2c2: | Covering and packing problems | (0 routines) |
| G2c3: | Knapsack problems | (0 routines) |
| G2c4: | Matching problems | (0 routines) |
| G2c5: | Routing, scheduling, location problems | (0 routines) |
| G2c6: | Pure integer programming | (1 routine) |
| G2c7: | Mixed integer programming | (2 routines) |