Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence |
| |
| Authors: | O A Yemets T N Barbolina |
| |
| Affiliation: | (1) Yu. Kondratuyk Technical University, Poltava, Ukraine;(2) V. G. Korolenko Pedagogical University, Poltava, Ukraine |
| |
| Abstract: | A method of space partition based on an equivalence relation is considered. Based on a lexicographic exhaustive search for equivalence classes, algorithms are developed for solution of a new class of optimization problems, namely, linear conditional Euclidean problems of lexicographic combinatorial optimization.Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 155–125, September–October 2004. |
| |
| Keywords: | multiset Euclidean optimization problem lexicographic exhaustive search |
| 本文献已被 SpringerLink 等数据库收录！ |
|
