This paper goes over a new kind of multiflow problem that we were unable to find in the literature. This problem relates to the efficiency of providing a specified amount of resources to specified locations from given sources. To do this, we introduce several new objects and techniques, including unrestricted flows, utilization, and the obstructed network problem. Through these new ideas, we arrived at an "any-time" algorithm for our problem, but also other techniques that may be useful for other multiflow problems and flow problems with variable capacities.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Finley, Matthew

Subject

• Industry
• Computing
• Infrastructure
• Energy

Publisher

• Worcester Polytechnic Institute

Identifier

• 20081
• E-project-042821-180852

Keyword

• networks
• flows
• graph theory
• unrestricted flows
• multiflows
• obstructed network problem

Advisor

• Servatius, Brigitte

Year

• 2021

Date created

• 2021-04-28

Resource type

• Major Qualifying Project

Major

• Data Science

Rights statement

• In Copyright

License

• Creative Commons BY-NC Attribution-NonCommercial 4.0 International