Combinatorial Optimization Problems
We consider combinatorial optimization problems (COP), i.e., finding extrema of an objective function on a combinatorial space. Many various important applied and theoretical problems of different degree of complexity can be presented as problems in graph theory. These, for example, are the problem of designing communication networks, engineering devices, electronic and digital equipment, traffic control, planning and management of industrial and commercial activities, layout of equipment. To solve them, the number graph theory is proposed. To solve other COP, the theories of mathematical safes, construction of discrete images, combinatorial recognition, and solution of extremum problems on combinatorial configurations are proposed. The theory of mathematical safes analyzes a number of problems on special graphs, which are called safes. One should use certain operations to decode the states of vertices called locks. It is used in coding theory, information security, and cryptology. The theory of constructing discrete images involves problems where it is necessary to use a given set of colored patterns to construct a prescribed image on a rectangular field of view. It is also used in coding theory and information security. The combinatorial recognition theory addresses problems of recognition of the properties of individual objects from some set by so-called tests or trials, which allow a wide interpretation. Such problems occur in various lotteries, banking sector, and insurance companies. The graph-theoretical approach is proposed to solve these problems. Many problems in economic and mathematical modeling reduce to optimization problems on combinatorial configurations such as permutations, partitions, combinations, arrangements, multisets, etc. To solve them, the direct structuring method based on the graph theory is proposed.
KeywordsCombinatorial Optimization Problem Combinatorial Problem Complex Image Elementary Image Oriented Graph
- 63.Donets, G.A., Shulinok, I.E.: Algorithm Complexity Assessment for Natural Modular Graphs, pp. 61–68. Teoriya Opt. Resh., IK NANU, Kyiv (2001)Google Scholar
- 64.Donets, G.A., Nezhentsev, Yu.I.: Algorithm complexity assessment in arithmetic graphs. In: Glushkov, V.M. (ed.) Methods of the Solution of Nonlinear and Discrete Programming Problems [in Russian]. Institute of Cybernetics of AS UkrSSR, Kyiv, pp. 79–88 (1991)Google Scholar
- 65.Donets’, G.P., Kolechkina, L.M.: Extremum Problems on Graphs [in Ukrainian]. RVV PUSKU, Poltava (2011)Google Scholar
- 135.Semenova, N.V., Kolechkina, L.M.: Vector Discrete Optimization Problems on Combinatorial Sets: Methods of Analysis and Solution [in Russian]. Naukova Dumka, Kyiv (2009)Google Scholar
- 147.Sergienko, I.V., Kaspshitskaya, N.F.: Models and Methods of Computer Solution of Combinatorial Optimization Problems [in Russian]. Naukova Dumka, Kyiv (1981)Google Scholar