These procedures enable to reduce the size of the instances before launching an off-the-shelf software for solving the mixed integer program.
At first, we solved problem with ɛ-Constraint method by GAMS software, but due to the complexity of the problem and available processing facilities, when the size of the instances increased for problems and for dimensions bigger than ten customers, metaheuristic method must, therefore, be applied.
Unfortunately, the N P -hardness of the MPPEP-SNP limits the size of the instances analyzable to the optimum, which in turn affects the ability to validate the parsimony criterion, hence the practical utility of the predictions themselves.
While the given network is small enough to be solvable by hand, it contains nevertheless the principal ingredients of complexity that would asymptotically make harder the problem as the size of the instances grows.
The computation of the guide tree itself has been left out from the parallelization, since in practice it is not a limiting factor, given the size of the instances T-Coffee can deal with and given the reliance on guide trees obtained through fast k-tup comparisons (Edgar, 2004 ).
In addition, there is an extensive classification of computable problems into computational complexity classes according to how much computation as a function of the size of the problem instance—is needed to answer that instance.
The uneven gaps in the sizes of the instances are because many edges have identical weights.
The large size of the problem instance motivating this research suggests that conventional exact dynamic programming algorithms are inappropriate.
The energy consumption of these components is heavily affected by the overall size of the SRAM instance being accessed.
