Abstract
We propose a strategy to solve the problem of optimization of a linear function on the set of cyclic permutations. The strategy is based on the properties of transpositions of special kind. The properties of this class of transpositions are investigated. Assertions about the impact of compositions of such transpositions on an arbitrary permutation are proved. For the approximate solutions obtained using the above strategy, estimation is substantiated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
