Abstract.
The paper considers the solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence. A generalization of the relation of equivalence, which is used for space splitting, is proposed and its properties are analyzed. The algorithms of the method known earlier are modified, an approximated algorithm is validated.
Keywords: multiset, mixed combinatorial Euclidean optimization problem, lexicographic enumeration.
Барболина Татьяна Николаевна,
кандидат физ.-мат. наук, доцент Полтавского национального педагогического университета
им. В.Г. Короленко,
e-mail: tn_b@rambler.ru.