Abstract. The concepts of functional representation of a set of points of the Euclidean arithmetic space and an extension of functions from the set onto its superset are introduced. Functional representations of sets are related to their extensions. Strict functional representations of the Boolean set, general permutation, and polypermutation sets are derived. The advantages of applying strict representations of Euclidean combinatorial sets to construct functional extensions from them and to solve combinatorial problems are presented.
Keywords: combinatorial optimization, Euclidean combinatorial set, continuous functional sets' representation, an extension of functions, the general permutation set, the boolean set.
Пичугина Ольга Сергеевна,
кандидат физ.-мат. наук, докторант Харьковского национального университета радиоэлектроники,
e-mail: pichugina@mail.ru
Яковлев Сергей Всеволодович,
доктор физ.-мат. наук, профессор Национального аэрокосмического университета им. Н.Е. Жуковского «ХАИ»,
e-mail: svsyak@mail.ru