Application of dynamic programming in the minimal superpermutation problem

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.

Saved in:

Bibliographic Details
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
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-139313
record_format	dspace
spelling	sg-ntu-dr.10356-1393132023-02-28T23:18:27Z Application of dynamic programming in the minimal superpermutation problem Ong, Linus Hong Jun Kiah Han Mao School of Physical and Mathematical Sciences hmkiah@ntu.edu.sg Science::Mathematics::Applied mathematics 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. Bachelor of Science in Mathematical Sciences 2020-05-18T21:55:00Z 2020-05-18T21:55:00Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/139313 en application/pdf Nanyang Technological University
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	Science::Mathematics::Applied mathematics
spellingShingle	Science::Mathematics::Applied mathematics Ong, Linus Hong Jun Application of dynamic programming in the minimal superpermutation problem
description	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.
author2	Kiah Han Mao
author_facet	Kiah Han Mao Ong, Linus Hong Jun
format	Final Year Project
author	Ong, Linus Hong Jun
author_sort	Ong, Linus Hong Jun
title	Application of dynamic programming in the minimal superpermutation problem
title_short	Application of dynamic programming in the minimal superpermutation problem
title_full	Application of dynamic programming in the minimal superpermutation problem
title_fullStr	Application of dynamic programming in the minimal superpermutation problem
title_full_unstemmed	Application of dynamic programming in the minimal superpermutation problem
title_sort	application of dynamic programming in the minimal superpermutation problem
publisher	Nanyang Technological University
publishDate	2020
url	https://hdl.handle.net/10356/139313
_version_	1759857730517991424

Application of dynamic programming in the minimal superpermutation problem

Similar Items