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 7 of 7 for “"Multicommodity flow problem"”.

  1. Network transformations and some applications

    … solution codes make it attractive to formulate problems as networks whenever such models are adequate for the purpose. In this thesis, conceptualization of, and notation used to express these models is based on the interpretation of physical flows of commodity through a network structure of …

    nps Repository record for Network transformations and some applications (opens in a new tab)

  2. A decomposition approach to solving core network design problems

    … network planners solve multilayer core network problems in a top-down manner, solving capacities for the top-most layer, and then using these solved capacities to solve the next lower layer. This results in a suboptimal solution, yielding higher capital expenditure costs. In this work an exact …

    nwu-za Repository record for A decomposition approach to solving core network design problems (opens in a new tab)

  3. The generalized machine layout problem.

    … obtained by solving machine and facility layout problems effectively. Commonly, facility and machine layout problems assume that product flows are either known or estimated before hand, and that the layout solution has enough capacity to satisfy all product demands. When product demands exceed …

    wvu Repository record for The generalized machine layout problem. (opens in a new tab)

  4. Directed multicommodity flows : cut-sufficiency and forbidden relevant minors

    In a multicommodity flow problem, the goal is to route paths in a supply graph G to satisfy demands between vertices, represented by a demand graph H. This must be done simultaneously for all commodities, without exceeding edge capacities. To do this, there can be no cut where the requested demand …

    ubc Repository record for Directed multicommodity flows : cut-sufficiency and forbidden relevant minors (opens in a new tab) Download PDF for Directed multicommodity flows : cut-sufficiency and forbidden relevant minors (opens in a new tab)

  5. Decomposition and Parallel Solution of Network-Structured Optimization Problems

    Optimization problems characterized by an embedded network structure in the constraint matrix are frequently used as a modeling tool in many diverse application areas such as transportation, logistics, finance, telecommunications and so on. We develop techniques that exploit the special structure …

    penn Repository record for Decomposition and Parallel Solution of Network-Structured Optimization Problems (opens in a new tab)

  6. A Graph-Theoretic Approach To Network Coding

    The network coding problem is a generalization of the maximum flow problem in which nodes can, in addition to forwarding messages, send encodings of combinations of incoming packets. This problem addresses the transmission of information, rather than physical goods, as information can be scrambled …

    cornell Repository record for A Graph-Theoretic Approach To Network Coding (opens in a new tab)

  7. Efficient and robust resource allocation for network function virtualization

    … gradually transitioning to NFV, ISPs face the problem of where to efficiently introduce NFV; here, we measure the efficiency by the amount of traffic that can be served in an NFV-enabled network. This problem is non-trivial as it is composed of two challenging subproblems: 1) placement of …

    temple Repository record for Efficient and robust resource allocation for network function virtualization (opens in a new tab)