On a combinatorial optimization problem
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 15-16
Citer cet article
Voir la notice de l'article provenant de 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.
[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