• Login
    View Item 
    •   Carroll Scholars Home
    • Mathematics, Engineering and Computer Science
    • Mathematics, Engineering and Computer Science Undergraduate Theses
    • View Item
    •   Carroll Scholars Home
    • Mathematics, Engineering and Computer Science
    • Mathematics, Engineering and Computer Science Undergraduate Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Applications of Network Flows

    Thumbnail
    View/Open
    WiensE_2018_Final.pdf (4.701Mb)
    Author
    Wiens, Erica
    Advisor
    Jodi Fusteen; Kay Satre; Amanda Francis
    Date of Issue
    2018-04-01
    Metadata
    Show full item record
    URI
    https://scholars.carroll.edu/handle/20.500.12647/3479
    Title
    Applications of Network Flows
    Type
    thesis
    Abstract
    Have you ever played a board game or a video game where you figured out the shortest path between two locations before moving? Or have you ever been following directions from Google Maps and noticed a red patch of slow moving traffic coming up? Then you have unknowingly seen and used network flows. Network flows are used to optimize a variety of problems including the shortest path problem, the maximum flow problem, and the minimum cost problem. Through applications, we will explore a few ways to approach these problems to determine how computationally efficient these algorithms are.
    Degree Awarded
    Bachelor's
    Semester
    Spring
    Department
    Mathematics, Engineering & Computer Science
    Collections
    • Mathematics, Engineering and Computer Science Undergraduate Theses

    Browse

    All of Carroll ScholarsCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV