Emporia ESIRC

The optimal assignment problem.

ESIRC/Manakin Repository

Show simple item record

dc.contributor.author Oliver, Laura J.
dc.date.accessioned 2012-07-09T21:34:33Z
dc.date.available 2012-07-09T21:34:33Z
dc.date.created 1992 en_US
dc.date.issued 2012-07-09
dc.identifier.uri http://hdl.handle.net/123456789/1807
dc.description 28 leaves en_US
dc.description.abstract This thesis is intended for an audience familiar with basic linear algebra. The topic covered is the assignment problem. Chapter I is the introduction to the problem and the assumptions made. Chapter 2 discusses Kuhn's algorithm for solving the assignment problem. An example is done throughout the discussion. Chapter 3 discusses the Hungarian method for solving the assignment problem. An example follows this method. Chapter 4 discusses finding the optimal solution and Chapter 5 summarizes the two methods and gives a direction for further study. en_US
dc.language.iso en_US en_US
dc.subject Algebras, Linear. en_US
dc.subject Mathematics. en_US
dc.title The optimal assignment problem. en_US
dc.type Thesis en_US
dc.college las en_US
dc.advisor Elizabeth Yantz en_US
dc.department mathematics, computer science, and economics en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record