Аннотация:
In this paper, we introduce a concept of the Euclidean combinatorial configuration as a mapping of a set of certain objects into a point of Euclidean space. We classify Euclidean combinatorial configurations sets based on their structure and constraints. The proposed typology forms the basis for studying continuous functional representations of combinatorial configurations. Special classes of functional extensions are introduced, their properties are described, and corresponding examples are given.
Ключевые слова и фразы:
combinatorial configuration, continuous representation, extensions, combinatorial optimization.
Полный текст:
PDF файл (202 kB)