Application of dynamic programming in the minimal superpermutation problem

• Main Author: Ong, Linus Hong Jun
• Other Authors: Kiah Han Mao
• Format: Final Year Project
• Language: English
• Published: Nanyang Technological University 2020
• Subjects: Science::Mathematics::Applied mathematics
• Online Access: https://hdl.handle.net/10356/139313
• Institution: Nanyang Technological University

We show our attempts to bound the minimal superpermutation on n symbols using dynamic programming, namely a variant of the Held{Karp algorithm. A reduction of the search space by introducing certain restrictions to was also done to improve the running time.