| Area | Number of publications | References |
| Integer linear programming (IP) | 3 | Lim et al. [24], Diepen et al. [25], Diepen et al. [26] |
| Binary integer programming | 6 | Mangoubi and Mathaisel [11], Yan et al. [29], Vanderstraeten and Bergeron [28], Bihr [12], Tang et al. [27], Prem Kumar and Bierlaire [18] |
| Mixed integer linear programming (MILP) | 3 | Bolat [30], Bolat [31], Kaliszewski and Miroforidis [37] |
| Mixed integer nonlinear programming | 3 | Li [5, 32], Bolat [31] |
| Quadratic programming (QP) | 6 | Bolat [34], Zheng et al. [33], Xu and Bailey [14], Ding et al. [6, 7, 35] |
| Multiple objective GAP formulations | 5 | Hu and Di Paolo [36], Wei and Liu [16], B.A.C.o.E.B. Team and A.I.C.o.E. Team [17], Yan and Huo [2], Kaliszewski and Miroforidis [37] |
| Stochastic models | 3 | Yan and Tang [10], Genç et al. [38], Şeker and Noyan [9] |
| Quadratic assignment problem (QAP) | 2 | Drexl and Nikulin [3], Haghani and Chen [13] |
| Scheduling problems | 1 | Li [39] |
| Clique partitioning problem (CPP) | 1 | Dorndorf et al. [8] |
| Network representation | 1 | Diepen et al. [41] |
| Robust optimization | 1 | Maharjan and Matis [40] |
| Exact algorithms | 7 | Mangoubi and Mathaisel [11], Bihr [12], Yan and Huo [2], Bolat [30, 34]; Xu and Bailey [14]; Li [39] |
| Heuristic algorithms | 16 | Thengvall et al. [43], Yan and Tang [10], Ding et al. [6, 35], Lim et al. [24], Diepen et al. [25], Dorndorf et al. [8], Mangoubi and Mathaisel [11], Vanderstraeten and Bergeron [28], Yan et al. [29], Bolat [30, 34], Haghani and Chen [13], Genç [42], B.A.C.o.E.B. Team and A.I.C.o.E. Team [17], Bouras et al. [45] |
| Metaheuristic algorithms | 14 | Ding et al. [6, 35], Ding et al. [7], Lim et al. [24], Hu and Di Paolo [36], Drexl and Nikulin [3], Xu and Bailey [14], Bolat [31], Şeker and Noyan [9], Zheng et al. [33], Wei and Liu [16], Gu and Chung [44], Cheng et al. [23], Bouras et al. [45] |
| OPL | 4 | Li [5, 32], Tang et al. [27], Prem Kumar and Bierlaire [18], Maharjan and Matis [40] |
|
|