Numerical analysis of tricriteria tree and assignment problems (Q1571283)

This paper is devoted to the numerical analysis of the three criteria tree and assignment problems by help of MINSUM-MINMAX-MINMAX criteria. It was established earlier that the relative number of effective solutions that can be found by solving single-criterion problems with a convex combination of the criteria depends only on the number of effective problem solutions and rapidly decreases with the increasing number of these solutions. In this paper, it is shown for the case of three criteria that the relative number of effective solutions that can be found by using the linear convolution is much greater than in the case of two criteria.