• Login
    View Item 
    •   Carroll Scholars Home
    • Carroll College Student Undergraduate Research Festival
    • Carroll College Student Undergraduate Research Festival 2018-2019
    • View Item
    •   Carroll Scholars Home
    • Carroll College Student Undergraduate Research Festival
    • Carroll College Student Undergraduate Research Festival 2018-2019
    • 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
    SURF_Presentation_Wiens.pdf (3.246Mb)
    Author
    Wiens, Erica
    Date of Issue
    2018-04-20
    Metadata
    Show full item record
    URI
    https://scholars.carroll.edu/handle/20.500.12647/7069
    Title
    Applications of Network Flows
    Abstract
    Have you ever played a board game or a video game where you mentally figured out the shortest path between two locations before moving? Or have you ever followed a sports team only to discover three quarters of the way through the season that they have no possible chance at winning because they are so far behind? Then you have unknowingly used network flows. Network flows can be used to optimize a variety of problems including shortest path, maximum flow, and finding the minimum cost of a flow. Through applications, we will explore a few ways to approach each of these problems to determine the most computationally efficient way to solve each problem.
    Collections
    • Carroll College Student Undergraduate Research Festival 2018-2019

    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