Kolechkina L. Methods of extreme problems' solutions on combinatorial configurations

Dissertation is devoted to the research of extreme problems on combinatorial configurations and to the development of approaches and methods of their decision. The methods of extreme problems decision are examined on different combinatorial configurations of two types - extreme one-criterion and multicriterion ones. Properties of combinatorial configurations are investigated with the use of graphs theory. The new methods of generation of combinatorial configurations which build the elements sequences of configurations where difference between two successive elements is minimum, and also which based on transferring of maximal element of plural from which configuration appears are developed on the basis of graphs theory properties. The new method of extreme combinatorial problems decision - method of structurization is offered. The method unites means of combinatorial analysis and graphs theory. This method was applied for the decision of problems with linear and linear fractional functions objective functions on different combinatorial configurations: permutations, partitions, connections and allocations. The proper information technologies which confirmed efficiency of this method were created.