Combinatorial Optimization: Introductory Problems and Methods
Erin Brownell · OpenCommons at University of Connecticut (University of Connecticut) · 2019
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.