Modelos matemáticos e problemas de optimização combinatória

Abstract

The paper presents the results of the analysis of different models that are used in problems of combinatorial optimization, such as graphs, sets, discrete matrices, and Boolean functions. It is shown that these models can be mutually converted one into another. Many examples of typical combinatorial tasks, which appear at different steps of the design of digital devices, are considered. The majority of these tasks can be solved with the aid of the presented models and the respective combinatorial methods. Finally, different ways of implementation of combinatorial algorithms are analyzed.