Table 4.
Results obtained by our dynamic programming algorithm on instances with large department lengths. The running times are given in min:sec or in h:min:sec respectively. The entries * indicate that the algorithm did not finish within the time limit of 24 h.
| Instance | Optimum | Time |
|---|---|---|
| P15L | 148059.5 | 47:45 |
| P17L | 438935.5 | 1:54:44 |
| P18L | 589182.5 | 3:58:42 |
| H_20L | 245666 | 1:32:45 |
| N25_05L | 554740.5 | 10:31:00 |
| H_30L | 752966 | 9:58:20 |
| N30_05L | 920622.5 | 16:10:33 |
| Am33_03L | 1078710.5 | 20:51:16 |
| Am35_03L | * | * |
| ste36.5L | * | * |
| N40_5L | * | * |
| sko42-5L | * | * |