Polyuga S. Fragmentary optimization models in problems graph covering of typical subgraphs

The object of study - discrete optimization problems typical graphs covering subgraphs. Subject of investigation - mathematical models of discrete optimization methods for finding approximate solutions of problems covering typical subgraphs graphs, as well as problems of integer cutting and packaging. The purpose of research - development of mathematical apparatus for construction and use of mathematical models of discrete optimization problems, fragmented structures research and evolutionary models to find optimal solutions to problems typical graphs covering subgraphs. Research Methods - discrete optimization, graph theory, matroid theory, decision theory, methods of mathematical modeling and simulation. Methods of search approximate solutions of problems of discrete optimization on the fragmentary models basis, improved methods of evolutionary modeling to find optimal solutions to problems of discrete optimization in metric spaces. Scope: traffic management, mechanical engineering, textile industry, printing industry and others.