On a combinatorial optimization problem
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 15-16
Cet article a éte moissonné depuis la source Math-Net.Ru
A combinatorial optimization problem reduced to the building a symmetric group in a format of minimal words is considered. There are solutions for some cases of the problem.
@article{PDMA_2012_5_a6,
author = {A. S. Kuznetsova and K. V. Safonov},
title = {On a~combinatorial optimization problem},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {15--16},
year = {2012},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a6/}
}
A. S. Kuznetsova; K. V. Safonov. On a combinatorial optimization problem. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 15-16. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a6/
[1] Kuznetsov A. A., Antamoshkin A. N., Shlëpkin A. K., “Modelirovanie periodicheskikh grupp”, Sistemy upravleniya i informatsionnye tekhnologii, 2008, no. 2, 4–8
[2] Halt D., Eick B., O'Brien E., Handbook of computational group theory, Chapman Hall/CRC Press, Boca Raton, 2005 | MR