We can see that in this example, if H1 is given 8 h, it finds all solutions that the exact method has found within 3 days of CPU effort, plus an additional solution with zero uncovered demand.
E.g., after having had a look at the Pareto front, the DM may decide that solutions with costs exceeding a certain level should not be taken into consideration, and that solutions for which the uncovered demand exceeds a certain threshold should be excluded as well.
This instance could not be solved by the exact method, although the last found solution has a very low uncovered demand; so it is likely that only few solutions on the true Pareto front have been missed by the exact method after the invested runtime of 3 days.
In this algorithm in each step the epitope in A covering the most yet uncovered proteins in P, is added to the solution set L, until all proteins are covered.
The actual uncovered demand R (y, z, ξ ) results as the solution of the second-stage problem (15)–(15).
In this sense, our needs assessment was both definitive and exploratory, in that it prioritized specific topics for future training, but also uncovered issues for which there is no easily implementable solution [ 13].
The uncovered SiO2 was then etched away in a 1 7 buffered hydrofluoric acid solution (ca. 15 min).
For the small number of cases where uncovered regions remain, we use a local branch and bound algorithm to refine the solution and try to find the correct tiles.
We then sampled each solution, transferred the sample into a clean vial, and allowed the vial uncovered for 5 min to vaporize the solvent before adding the CMU sample, which was mixed equally from 9 castrated donors into the vial, as desired scented CMU.
Thus, as in the construction of the initial solution, the interaction of factors I l that has the largest amount of uncovered t-tuples is selected, so that these will become new test cases.
