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 26 for “"Multicommodity Flow"”.

  1. 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)

  2. A Two-Phase Multicommodity Flow Approach for Classroom Assignment

    … bipartite matching for priority assignment and a multicommodity flow model to assign remaining courses. The optimal solution minimizes the walking distance between classrooms for professors teaching back-to-back courses and the walking distance between classrooms and professors’ offices. The …

    ut-knoxville Repository record for A Two-Phase Multicommodity Flow Approach for Classroom Assignment (opens in a new tab)

  3. On the core of the multicommodity flow game without side payments

    … a cooperative game without side payments. This "multicommodity flow" game was initially introduced by Papadimitriou to model incentives in internet routing. He posed the questions of whether such stable solutions exist and if we can find them. Markakis and Saberi showed both how to solve this …

    ubc Repository record for On the core of the multicommodity flow game without side payments (opens in a new tab) Download PDF for On the core of the multicommodity flow game without side payments (opens in a new tab)

  4. Performance Improvement of Multicommodity Flow of Tactile and Best Effort Packet in Internet Network

    … investigated the methods for multi-commodities flows, comprise of haptic and best-effort packet, which will improve the network utilization and throughput. It also minimize the network cost such as: total delay and packet error.<br/><br/>Moreover, through this study, it has been ensured that the …

    kings Repository record for Performance Improvement of Multicommodity Flow of Tactile and Best Effort Packet in Internet Network (opens in a new tab) Download PDF for Performance Improvement of Multicommodity Flow of Tactile and Best Effort Packet in Internet Network (opens in a new tab)

  5. Multicommodity flow applied to the utility model: a heuristic approach to service level agreements in packet networks

    … the Utility Model using a modified version of a Multicommodity Flow algorithm, which has better computational complexity than Knapsack Algorithms or many heuristics and hence is capable of finding paths relatively quickly for larger networks. What's more, the Multicommodity flow algorithm used …

    uvic Repository record for Multicommodity flow applied to the utility model: a heuristic approach to service level agreements in packet networks (opens in a new tab)

  6. 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

  7. Throughput Stability and Flows in Large-Scale Random Networks

    … as one of determining the value of the maximum multicommodity flow on the corresponding random unit-disk graph and shown to be equivalent. In this way, using simple flow techniques and probability tools, a tight bound is derived on the rate of growth of the maximum stable throughput with a …

    cornell Repository record for Throughput Stability and Flows in Large-Scale Random Networks (opens in a new tab)

  8. Algorithmic techniques for optimal collective communication

    … host and network topology. We provide a novel multicommodity flow-based approach that allows us to find provably optimal algorithms in terms of both latency and bandwidth utilization. Critical to our techniques are two important innovations: a conversion method from fluid solutions to discrete …

    cornell Repository record for Algorithmic techniques for optimal collective communication (opens in a new tab)

  9. 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)

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

    … of the algorithm: (1) for the network flow problem with side constraints, (2) for the multicommodity flow problem. We present numerical results with Patient Distribution System (PDS) multicommodity flow problems and with network flow problems with side constraints derived from matrix …

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

  11. Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees

    … vertices. In this thesis we present two new multicommodity flow formulations and a new cut-based formulation to learn such optimal binary classification trees. We then provide a comparison of the formulations' strength, valid inequalities to strengthen all formulations, and accompanying …

    rice Repository record for Mixed Integer Linear Optimization Formulations for Learning Optimal Binary Classification Trees (opens in a new tab)

  12. Network transformations and some applications

    … is based on the interpretation of physical flows of commodity through a network structure of nodes and arcs. As an aid to modelling, and to allow codes of varying specificity to be used, nine well-known Transformations are catalogued here for easy reference. Two recent results for special …

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

  13. 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)

  14. Monterey Bay Aquarium volunteer guide scheduling analysis

    … stations. The guide schedule was modeled as a multicommodity flow network and solved with linear programing.

    nps Repository record for Monterey Bay Aquarium volunteer guide scheduling analysis (opens in a new tab)

  15. A decomposition approach to solving core network design problems

    … a single model. Each layer takes the form of a multicommodity flow problem. The objective is to minimize capital expenditure costs, and the integrated network model is shown to be able to reduce costs. This however aggravates the computational burden, and as such, methods to improve scalability …

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

  16. New Insights on the Multistage Insertion Formulation of the Traveling Salesman Problem Polytopes, Algorithms, and Experiments

    … polytope can be associated with the maximum multicommodity flow in some layered network being equal to one. Using a numerical example, we illustrate a procedure for checking this necessary condition. We answer the question of the necessary condition being sufficient in the negative by …

    auckland-ms Repository record for New Insights on the Multistage Insertion Formulation of the Traveling Salesman Problem Polytopes, Algorithms, and Experiments (opens in a new tab)

  17. The generalized machine layout problem.

    … 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 capacities of planned production systems, it is important to select a feasible product mix …

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

  18. Satellite Network, Design, Optimization, and Management

    … other more general multistage stochastic integer multicommodity flow problems. Finally, we motivate the notion of reload costs that refer to variable (i.e., per unit of flow) costs for the usage of pairs of edges, as opposed to single edges. We highlight the practical and theoretical significance …

    maryland Repository record for Satellite Network, Design, Optimization, and Management (opens in a new tab)

  19. Combined objective least squares and long step primal dual subproblem simplex methods

    … simplex method (LPD) to solve large-scale multicommodity flow problems(MCF), and with this work, we achieved better performance than primal dual subproblem simplex methods (PD) and Dantzig-Wolfe (DW) decomposition approaches.

    gatech Repository record for Combined objective least squares and long step primal dual subproblem simplex methods (opens in a new tab)

  20. Convergence Analysis of Markov Chain Monte Carlo Methods for Model Selection Problems

    … results through two independent techniques: the multicommodity flow method and single-element drift condition analysis; we find that the latter yields a tighter mixing time bound. We also prove that MTM can achieve a mixing time bound that is smaller than that of a random walk MH by a factor of …

    tamu Repository record for Convergence Analysis of Markov Chain Monte Carlo Methods for Model Selection Problems (opens in a new tab)

Page 1 of 2