A polynomial time heuristic algorithm for certain instances of 3-partition

Cardinal Scholar

Show simple item record

dc.contributor.advisor Zage, Dolores M.
dc.contributor.author Smith, Ronald Douglas
dc.date.accessioned 2014-05-07T15:33:08Z
dc.date.available 2014-05-07T15:33:08Z
dc.date.issued 2014-05-03
dc.identifier.uri http://cardinalscholar.bsu.edu/handle/123456789/198150
dc.description.abstract There are problems in computational complexity so difficult that the only known ways to solve them are impractical. A problem that has a few hundred inputs may take more time to solve with a super computer than the time that has passed since the beginning of the universe. One of these problems is the strongly NP-Complete 3-Partition. The goal of this thesis is to examine a fast heuristic algorithm that can solve 3-Partition quickly in certain cases but in the worst case may not find a solution even though one exists.
dc.description.sponsorship Department of Computer Science
dc.subject.lcsh Heuristic algorithms
dc.subject.lcsh NP-complete problems
dc.title A polynomial time heuristic algorithm for certain instances of 3-partition en_US
dc.description.degree Thesis (M.S.)
dc.identifier.cardcat-url http://liblink.bsu.edu/catkey/1749602


Files in this item

This item appears in the following Collection(s)

  • Master's Theses [5318]
    Master's theses submitted to the Graduate School by Ball State University master's degree candidates in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


Browse

My Account