In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria optimization problems with a finite criterion-valued set. We found conditions under which this problem is solvable by a linear convolution of criteria (LCC-solvable). i.e. each Pareto optimum of the problem may be got as an optimal solution in the parametric problem with one aggregative criterion. We also propose an algorithm allowing to resume any combinatorical multicriteria optimization problem to a problem with the same Pareto set, but LCC-solvable. (orig.)Available from TIB Hannover: RR 4487(1996,26) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman