Date of Completion
Spring 5-1-2019
Thesis Advisor(s)
Myron Minn-Thu-Aye
Honors Major
Applied Mathematical Sciences
Disciplines
Other Applied Mathematics | Physical Sciences and Mathematics
Abstract
This paper will cover some topics of combinatorial optimization, the study of finding the best possible arrangement of a set of discrete objects. These topics include the shortest path problem and network flows, which can be extended to solve more complex problems. We will also briefly cover some basics of graph theory and solving linear programming problems to give context to the reader.
Recommended Citation
Brownell, Erin, "Combinatorial Optimization: Introductory Problems and Methods" (2019). Honors Scholar Theses. 626.
https://digitalcommons.lib.uconn.edu/srhonors_theses/626