Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 227 for “"maximum flow"”.

  1. Robust Maximum Flow Network Interdiction Problem

    In this thesis, a maximum flow-based network interdiction problem considering uncertainties in arc capacities and interdiction resource consumption is solved. The problem consists of two entities with opposing objectives: the goal of the adversary is to maximize the flow of illicit drugs through …

    portland-state Repository record for Robust Maximum Flow Network Interdiction Problem (opens in a new tab)

  2. Parallel Algorithms for the Maximum Flow

    The problem of finding the maximal flow through a given network has been intensively studied over the years. The classic algorithm for this problem given by Ford and Fulkerson has been developed and improved by a number of authors including Edmonds and Karp. With the advent of parallel computers, …

    glasgow Download PDF for Parallel Algorithms for the Maximum Flow (opens in a new tab)

  3. A self-stabilizing distributed maximum flow algorithm

    … thesis presents a self-stabilizing distributed maximum flow algorithm for a network G = (V, E), where V is a set of nodes in the network and E is a set of edges in the network. The algorithm has two phases: reset phase and preflow-push phase. Fault-tolerance is achieved by using a …

    unlv Repository record for A self-stabilizing distributed maximum flow algorithm (opens in a new tab) Download PDF for A self-stabilizing distributed maximum flow algorithm (opens in a new tab)

  4. The K-group maximum-flow network-interdiction problem

    … in which a "network user" attempts to maximize flow among K >/= 3 "node groups", while an "interdictor" interdicts (destroys) network arcs, using limited interdiction resources, to minimize this maximum flow. We develop two models to solve or approximately solve KNIP. The multi-partition …

    nps Repository record for The K-group maximum-flow network-interdiction problem (opens in a new tab)

  5. Two problems in dynamic graph analytics : maximum flow and online partitioning

    … approach, we propose a novel algorithm for the maximum flow problem, targeting graphs that evolve quickly with millions of edge changes per second. The algorithm works well on a shared-nothing, asynchronous computational model in which the graph topology is updated concurrently as the algorithm …

    ubc Repository record for Two problems in dynamic graph analytics : maximum flow and online partitioning (opens in a new tab) Download PDF for Two problems in dynamic graph analytics : maximum flow and online partitioning (opens in a new tab)

  6. Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters

    … set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer to this as the covering dual, since when we allow covers to be fractional and relax the notion of disjoint sets, the natural Linear Programming (LP) formulations become duals and the optimal …

    waterloo Repository record for Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters (opens in a new tab)

  7. Performance study of an implementation of the push-relabel maximum flow algorithm in Apache Spark's GraphX, A

    … the intention of implementing a solution to the Maximum Flow Problem, a complex graph problem without a trivial distributed approach. Specifically, the implementation is to be based on the serial Push-Relabel algorithm. An original MapReduce-based approach to the problem is presented, as well as …

    colo-mines Repository record for Performance study of an implementation of the push-relabel maximum flow algorithm in Apache Spark's GraphX, A (opens in a new tab)

  8. Advancements on problems involving maximum flows

    … presents new results on a few problems involving maximum flows. The first topic we explore is maximum flow network interdiction. The second topic we explore is reoptimization heuristics for rapidly solving an entire sequence of Maximum Flow Problems. In the Cardinality Maximum Flow Network …

    gatech Repository record for Advancements on problems involving maximum flows (opens in a new tab)

  9. Computation of maximum flows in networks

    … theory and methods for the computation of maximum flow in networks is presented along with a simplified method for determination of a feasible flow in networks with upper and lower bounded arcs. A computational procedure is presented which is used to calculate the maximum flow for a general …

    nps Repository record for Computation of maximum flows in networks (opens in a new tab)

  10. Algebraic Approaches to Stochastic Optimization

    … algebraic approaches to the shortest path and maximum flow problems in stochastic networks. The goal of the stochastic shortest path problem is to find the distribution of the shortest path length, while the goal of the stochastic maximum flow problem is to find the distribution of the maximum …

    clemson Repository record for Algebraic Approaches to Stochastic Optimization (opens in a new tab)

  11. Effect of Printing Parameters on the Structure and Properties of 316l Stainless Steel

    … the perpendicular surface exhibited high maximum flow stress with a low strain whereas the parallel surface had lower maximum flow stress with a high strain. For the individual printing parameters, any combination of parameters that gives a finer microstructure showed higher flow stress …

    york Repository record for Effect of Printing Parameters on the Structure and Properties of 316l Stainless Steel (opens in a new tab)

  12. Application of push-relabel and heuristics to open pit mines

    … is to transform the pit limit problem to a maximum flow network. A popular maximum flow technique is push relabel. The purpose of this thesis is twofold. The first is to check if push relabel algorithm performs better than other MF algorithms on real, rather than randomly generated data (as …

    ubc Repository record for Application of push-relabel and heuristics to open pit mines (opens in a new tab) Download PDF for Application of push-relabel and heuristics to open pit mines (opens in a new tab)

  13. Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications

    … multiple variations on two classical network flow problems, the maximum flow and minimum-cost flow problems. These two problems are well-studied within the optimization community, and many models and algorithms have been presented for their solution. Due to the unique characteristics of the …

    clemson Repository record for Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications (opens in a new tab)

  14. Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)

    … is designated to be the destination, and a (tau)-maximum flow is defined to be a routing assignment which maximizes the amount of commodity reaching the destination before time (tau). The key discovery used to solve the problem is that a routing assignment has minimum delay if and only if it is a …

    uiuc Repository record for Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) (opens in a new tab)

  15. BiRotor Meter Product Selector

    … a difficult process. A meter is characterized by flow range (minimum and maximum flow rate), accuracy over the flow range and pressure drop. Meter selection involves matching the flow range of the meter to the flow range of the process conditions at desired measurement accuracy without exceeding …

    gsu Repository record for BiRotor Meter Product Selector (opens in a new tab)

  16. RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS

    … efficiency on the shortest path and maximum flow interdiction problems. We construct networks using two operationally meaningful structures: a grid structure designed to represent an urban transportation network, and a layered network designed to mimic a supply chain. We vary the size …

    nps Repository record for RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS (opens in a new tab)

  17. LOGISTICS IN A CONTESTED ENVIRONMENT: NETWORK ANALYSIS AND FLOW OPTIMIZATION

    … of logistic assets. In this thesis, we develop a maximum flow algorithm and apply it to our logistics network. Our proposed maximum flow algorithm optimizes vessel configuration and routing to satisfy as much demand as possible. We hope our study provides insights into the capabilities of the …

    nps Repository record for LOGISTICS IN A CONTESTED ENVIRONMENT: NETWORK ANALYSIS AND FLOW OPTIMIZATION (opens in a new tab)

  18. Analysis of Babu and Odeh's Model

    … this work, Babu and Odeh’s model for estimating flow rate from partially penetrating systems is studied. A VBA code is written in order to simulate the model and its results are compared against simulations using Eclipse Software. Sensitivity to different parameters is analyzed and an …

    tamu Repository record for Analysis of Babu and Odeh's Model (opens in a new tab)

Page 1 of 12