| | Mathematical Programming | [17, 33, 34, 47, 60, 90, 92, 125, 136, 142, 164] |
| | Integer programming | [8, 10, 23, 25, 28, 32, 41, 49, 52–54, 95, 110, 113, 114, 122, 140, 149, 156, 159] |
| | Mixed integer programming | [1, 9, 13, 21, 24, 27, 30, 36, 40, 44, 56, 58, 62, 66, 68, 70, 71, 78, 84, 85, 86, 93, 100, 102, 104, 126, 128, 134, 138, 144, 152, 157, 162] |
| | Goal programming | [15, 16, 42] |
| | Dynamic programming | [23, 149, 160] |
| | Constraint programming | [87, 137, 152, 166] |
| | Simulation | [6, 14, 20, 21, 30, 31, 35, 38, 49, 51, 55, 58, 61, 73, 76, 77, 83, 91, 95, 96, 97, 102, 105, 106, 116, 118, 119, 131, 133, 143, 145, 153, 158, 161, 163, 167] |
| | Branch bounding algorithm | [61, 121] |
| | Lagrangian relaxation approach | [45, 65, 148] |
| | Heuristic algorithm | [7, 13, 18, 26, 37, 54, 57, 59, 73, 85, 103, 109, 112, 113, 115, 123, 128, 147, 162, 118, 94, 156, 140, 98, 141] |
| | Genetic algorithm | [9, 19, 62, 82, 89, 124, 131, 135, 154] |
| | Ant colony algorithm | [29, 46, 145, 164] |
| | Annealing simulation | [24, 51, 77, 143] |
| | Other methods | [6, 11, 12, 22, 38, 39, 43, 46, 48, 50, 63, 64, 67, 69, 72, 74, 79, 80, 81, 88, 92, 99, 101, 107, 108, 111, 117, 120, 127, 129, 130, 132, 139, 146, 150, 151, 155, 161, 165, 168, 169, 170] |
|
|
