A Super Permutation Algorithm
Keywords:
Super Permutation, Algorithm, MathematicsAbstract
We present an algorithm that finds a string that contains every permutation of n symbols as a contiguous sub
string, also called super permutation, from a given starting permutation. The algorithm is simple and can be implemented
for any element, as the algorithm is independent of the representation of n. The algorithm also produces shortest super
permutation for n smaller than 6.
References
Robin Houston. “Tackling the minimal superpermutation problem.” arXiv:1408.5108, 2014
Gilbert Laporte and Silvano Martello. “The selective travelling salesman problem.” “Discrete applied mathematics”: pp. 193–207, 1990.
Desmond Lobo, Kalpita Wagaskar, Sarang Gawane, Clifford Fernandes, "Hybrid Quantum - Classical AI based approach to solve the Traveling Tournament Problem", International Journal of Computer Sciences and Engineering, Vol.9, Issue.6, pp.83-90, 2021.
S. Suriya, M. Rahul Kumar, "Solving Travelling Salesman Problem using an Enhanced Ant Colony Algorithm", International Journal of Computer Sciences and Engineering, Vol.7, Issue.7, pp.214-222, 2019.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
