### Refine

#### Has Fulltext

- yes (2) (remove)

#### Institute

- Professur Informatik im Bauwesen (2) (remove)

#### Keywords

- Stabilität (2) (remove)

A multicriterial statement of the above mentioned problem is presented. It differes from the classical statement of Spanning Tree problem. The quality of solution is estimated by vector objective function which contains weight criteria as well as topological criteria (degree and diameter of tree). Many real processes are not determined yet. And that is why the investigation of the stability is very important. Many errors are connected with calculations. The stability analysis of vector combinatorial problems allows to discover the value of changes in the initial data for which the optimal solution is not changed. Furthermore, the investigation of the stability allows to construct the class of the problems on base of the one problem by means of the parameter variations. Analysis of the problems with belong to this class allows to obtaine axact and adecuate discription of model

This work was partially supported by DAAD, Fundamental Researches Foundation of Belarus and International Soros Science Education Program We consider a vector discrete optimization problem on a system of non- empty subsets (trajectories) of a finite set. The vector criterion of the pro- blem consists partial criterias of the kinds MINSUM, MINMAX and MIN- MIN. The stability of eficient (Pareto optimal, Slater optimal and Smale op- timal) trajectories to perturbations of vector criterion parameters has been investigated. Suficient and necessary conditions of eficient trajectories local stability have been obtained. Lower evaluations of eficient trajectories sta- bility radii, and formulas in several cases, have been found for the case when l(inf) -norm is defined in the space of vector criterion parameters.