In addition, we report on the running time in seconds (t [ s]), the model CUT F needs to solve the instances of the mp/q group to optimality.
The obtained slow down factors indicate that the MTZ model is the most affected by increasing the costs of the core network: MTZ needs about 7 times more time to solve the instances to optimality, if the costs of the core network are multiplied by factor M=10.
These results are compared with the results of solving the instance 20×9-c by the improved NSGA-II, as shown in Tables8 Tables8
An extensive computational analysis shows that our new exact algorithm is capable of efficiently solving all the instances of the literature and turns out to be the best algorithm for instances with a low number of classes.
PMS5 [ 7] computes the common d-neighbors of three l-mers using integer programming formulation, which is an efficient algorithm for solving the difficult instances of PMS: (21, 8) and (23, 9).
Table1 shows the results obtained by the model including the number of instances solved to optimality by the model in each problem size and the average computational time required to solve the instances.
In contrast, the Flow-RM was unable to solve the instance p5, regardless of the value of k considered.
Except for HapCUT, it is possible to observe that all the algorithms are able to solve all the instances of the reconstruction problem for each parameter assignment in <5 s in the worst case, making all of them suitable for real applications.
Random processes should not count as computations: unlike computations properly so called, random processes cannot be used to generate the desired values of a function or solve the desired instances of a general problem.
To solve the large instances of the problem, a Lagrangean decomposition approach allowing parallel solution of the scenario subproblems is implemented in the GAMS grid computing environment.
