id: 02230148
dt: j
an: 02230148
au: Emets, O.A.; Barbolina, T.N.
ti: Solution of Euclidean combinatorial optimization problems by the method of
    construction of a lexicographic equivalence.
so: Cybern. Syst. Anal. 40, No. 5, 726-734 (2004); translation from Kibern.
    Sist. Anal. 2004, No. 5, 155-125 (2004).
py: 2004
pu: Springer (Consultants Bureau), New York, NY
la: EN
cc: 
ut: multiset; Euclidean optimization problem; lexicographic exhaustive search
ci: 
li: doi:10.1007/s10559-005-0010-2
ab: Summary: 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.
rv: