THE ALGORITHM OF FINDING PARETO-OPTIMAL SOLUTIONS FOR NEXT RELEASE PROBLEM
We consider three versions of the algorithm of Pareto-front building for their application to the next release problem based on the model of bi-objective optimization. It is shown that the algorithm of combinations enumeration with filtering is the best algorithm accordingly of criteria of computation time and memory consumption.