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 17 of 17 for “"MULTICOMMODITY FLOWS"”.

  1. Uniform multicommodity flows in random networks

    … vertices in &Nscr;, a corresponding <em>uniform multicommodity flow</em> <em>F</em> of volume φ consists of simultaneous flows of volume φ of unique commodities between each pair of vertices in &Vscr;. The <em>maximum uniform flow volume</em> is the maximum value of φ such that there is a uniform …

    oxford Restricted access

  2. Branch-and-price and multicommodity flows

    … and integer programming and apply them to three multicommodity flow problems. For (mixed) integer programming problems, the approach taken consists in reformulating an original model, using the Dantzig-Wolfe decomposition principle, and then combining column generation with branch-and-bound …

    minho-thes Repository record for Branch-and-price and multicommodity flows (opens in a new tab)

  3. Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)

    This thesis is a study of a wide variety of combinatorial optimization problems.

    uiuc Repository record for Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming) (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. Maximum Flows in Unit-Capacitated Multicommodity Trees

    Multicommodity flows are studied, in the special case where the underlying graph is a tree and all arc capacities are one.

    uiuc Repository record for Maximum Flows in Unit-Capacitated Multicommodity Trees (opens in a new tab)

  6. Dynamic multicommodity flow schedules

    Some new results in the scheduling of dynamic multicommodity flows in data communication networks are presented. A new performance measure for effective delivery of backlogged data to their destinations is defined and the solution to the resulting delivery problem is obtained through a sequential …

    nps Repository record for Dynamic multicommodity flow schedules (opens in a new tab)

  7. On Robust Distributed Control of Transportation Networks

    … control strategy can handle larger exogenous inflows to the network than the GPA-controller. Since the traffic signal controllers such as the GPA may allocate service to an empty line, due to the fact that several lanes can receive green light simultaneously, a model that handles this issue is …

    lund Repository record for On Robust Distributed Control of Transportation Networks (opens in a new tab) Download PDF for On Robust Distributed Control of Transportation Networks (opens in a new tab)

  8. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization

    … We also investigate the areas of network design, multicommodity flows, and packing/covering integer programs. All of these problems are NP-complete so it is natural to seek approximation algorithms with the best provable approximation ratio. Overall, we show some new techniques that enhance the …

    waterloo Repository record for Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization (opens in a new tab)

  9. Approximation algorithms for submodular optimization and graph problems

    … the gap between fractional and integral multicommodity flows. We give a poly-logarithmic approximation with constant congestion for the node-disjoint paths problem and we show a poly-logarithmic upper bound on the gap between the maximum fractional and integral throughput flows in …

    uiuc Repository record for Approximation algorithms for submodular optimization and graph problems (opens in a new tab)

  10. Resource management in wireless networks and the smart power grid.

    … yield (near-)optimal end-to-end rates, multicommodity flows, link capacities, and average powers. These design variables are obtained offline, and are subsequently used for control during network operation. Moreover, physical layer power allocation algorithms that are seamlessly …

    umn Repository record for Resource management in wireless networks and the smart power grid. (opens in a new tab)

  11. Víceproduktové toky v sítích a jejich optimalizace

    Diplomová práca sa zaoberá viacproduktovými tokmi v sieťach a ich optimalizáciou. V teoretickej časti sumarizuje základné pojmy tokov v sieťach, vzťah jednoproduktových a viacproduktových úloh, hlavné formulácie viacproduktového toku a vybrané metódy ich riešenia. Praktická časť je zameraná na …

    brno-tech Repository record for Víceproduktové toky v sítích a jejich optimalizace (opens in a new tab)

  12. ΕΥΡΕΤΙΚΗ ΠΡΟΣΕΓΓΙΣΗ ΣΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΣΧΕΔΙΑΣΜΟΥ ΔΙΚΤΥΟΥ ΜΕ ΠΑΓΙΑ ΚΑΙ ΜΕΤΑΒΛΗΤΑ ΣΤΟΙΧΕΙΑ ΚΟΣΤΟΥΣ

    THE PURPOSE OF THIS THESIS IS THE STUDY OF THE MULTICOMMODITY NETWORK DESIGN PROBLEM WITH FIXED AND VARIABLE COST ELEMENTS (MNDP). WE EXAMINE THE ECONOMIC ASPECTS OF THE CAPACITY EXPANSION OF THE SYSTEMS WITH ECONOMIES OF SCALE, WHICH MAY APPROXIMATELY BE MODELLED AS MNDP. IT IS SUGGESTED IN WHAT …

    greece Repository record for ΕΥΡΕΤΙΚΗ ΠΡΟΣΕΓΓΙΣΗ ΣΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΣΧΕΔΙΑΣΜΟΥ ΔΙΚΤΥΟΥ ΜΕ ΠΑΓΙΑ ΚΑΙ ΜΕΤΑΒΛΗΤΑ ΣΤΟΙΧΕΙΑ ΚΟΣΤΟΥΣ (opens in a new tab)

  13. Toky v sítích, algoritmy a aplikace

    Tato diplomová práce popisuje algoritmy pro hledání maximálního toku v síti. Samotným algoritmům předchází seznámení se s problematikou toku v sítích, základními definicemi a pojmy. Je zde uvedena transformace problému na další grafové úlohy, využití maximálních toků v síti v praxi a víceproduktové …

    brno-tech Repository record for Toky v sítích, algoritmy a aplikace (opens in a new tab)