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 58 for “"network flow problem"”.

  1. Bar-representable visibility graphs and a related network flow problem

    … provided. Weighted and directed versions of the problem are also formulated and solved; in particular, polynomial time algorithms for the layout of such graphs are developed. The Planar Full Flow problem is to determine a plane embedding and an (acyclic) orientation of an undirected planar …

    ubc Repository record for Bar-representable visibility graphs and a related network flow problem (opens in a new tab) Download PDF for Bar-representable visibility graphs and a related network flow problem (opens in a new tab)

  2. Using interior point methods to solve the multicommodity network flow problem.

    … by Karmarkar (36) for solving Multicommodity Network Flow problems (MCNF). In these problems, several commodities must be shipped between various nodes of a network. The goal is to satisfy the shipping requirements at a minimum cost, while respecting processing capacities on the joint flow of …

    ottawa-retro Repository record for Using interior point methods to solve the multicommodity network flow problem. (opens in a new tab)

  3. Hybrid Statistical Data Mining Framework for Multi-Commodity Fixed Charge Network Flow Problem

    This paper presents a new approach to analyze the network structure in multi-commodity fixed charge network flow problems (MCFCNF). This methodology uses historical data produced from repeatedly solving the traditional MCFCNF mathematical model as input for the machine-learning framework. Further, …

    rit Repository record for Hybrid Statistical Data Mining Framework for Multi-Commodity Fixed Charge Network Flow Problem (opens in a new tab)

  4. A dual network exterior point simplex-type algorithm for the minimum cost network flow problem

    The Minimum Cost Network Flow Problem (MCNFP) refers to a wide category of network flow problems and it is an important research area of Network Optimization. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here. The algorithm belongs to the special category of …

    greece Repository record for A dual network exterior point simplex-type algorithm for the minimum cost network flow problem (opens in a new tab)

  5. Solution of large-scale multicommodity network flow problems via a logarithmic barrier function decomposition

    … the solution of the large-scale multicommodity network flow problem. Placing the complicating joint capacity constraints of the multicommodity network flow problem into a logarithmic barrier term of the objective function creates a nonlinear mathematical program with linear network flow …

    nps Repository record for Solution of large-scale multicommodity network flow problems via a logarithmic barrier function decomposition (opens in a new tab)

  6. Resilient and Risk-Averse Network Systems

    … solution methodologies for graph-theoretical problems involving topologically stochastic information appearing in various forms. Weutilize a stochastic programming framework grounded in coherent risk measures to identify minimum-risk graph structures under stochastic vertex and/or edge …

    arizona-thes Repository record for Resilient and Risk-Averse Network Systems (opens in a new tab)

  7. Integration of fuzzy optimization and stochastic programming in multi-commodity network flow problems

    This study analyzes the problem of transporting vital commodities and emergency personnel during the response stage of a disaster relief operation by integrating fuzzy linear optimization and stochastic programming. This transportation system is treated as a probabilistic, multi-commodity, …

    liege Repository record for Integration of fuzzy optimization and stochastic programming in multi-commodity network flow problems (opens in a new tab)

  8. Integer programming approaches to networks with equal-split restrictions

    … integer programming approaches for solving network flow problems with equal-split restrictions. Such problems arise in traffic engineering of internet protocol networks. Equal-split structure is used in protocols like OSPF and IS-IS that allow flow to be split among the multiple shortest …

    gatech Repository record for Integer programming approaches to networks with equal-split restrictions (opens in a new tab)

  9. Graphical algorithms for solving minimal cost network flow problems and applications

    … can be used to minimize linear functions of flow in a directed network or digraph. These algorithms can be preformed directly on the graph, and hence eliminate the need for simplex tableaus, and increase solution speed. In addition, the paper gives several examples of important applications …

    ut-knoxville Repository record for Graphical algorithms for solving minimal cost network flow problems and applications (opens in a new tab)

  10. Singly-constrained monotropic network flow problems : a linear time transformation to unconstrained problems and qualitative sensitivity analysis

    This thesis examines several problems related to singly-constrained Monotropic Network Flow Problems. In the first part, a linear time algorithm that reduces the solution of a monotropic network flow problem with an additional linear equality constraint to the solution of lower dimensional …

    ubc Repository record for Singly-constrained monotropic network flow problems : a linear time transformation to unconstrained problems and qualitative sensitivity analysis (opens in a new tab) Download PDF for Singly-constrained monotropic network flow problems : a linear time transformation to unconstrained problems and qualitative sensitivity analysis (opens in a new tab)

  11. An optimisation approach to improve the throughput in wireless mesh networks through network coding

    In this study, the effect of implementing Network Coding on the aggregated throughput in Wireless Mesh Networks, was examined. Wireless Mesh Networks (WMNs) are multiple hop wireless networks, where routing through any node is possible. The implication of this characteristic, is that messages flow …

    nwu-za Repository record for An optimisation approach to improve the throughput in wireless mesh networks through network coding (opens in a new tab)

  12. Escape from the Delta: preparation and evacuation for catastrophic flooding in California Emergency Management Agency Region IV

    … flood. Specifically, we build a minimum cost network flow problem to represent the movement of more than one million people within Yolo, Sacramento, San Joaquin, and Stanislaus Counties. Our model solves for "best case" evacuation routes and clearing times assuming perfect knowledge of flood …

    nps Repository record for Escape from the Delta: preparation and evacuation for catastrophic flooding in California Emergency Management Agency Region IV (opens in a new tab)

  13. Properties and Paradigms of Robust Optimization

    … for dealing with uncertainty in optimization problems. In this thesis, we provide a deeper understanding of the properties and paradigms of robust optimization. We examine the continuity properties of robust optimization problems with respect to their uncertainty sets, and the paradigms of …

    toronto-retro Repository record for Properties and Paradigms of Robust Optimization (opens in a new tab)

  14. Analyzing soldier in-processing at the United States Army Field Artillery Training Center through simulation

    … particularly surges during summer time, cause problems that ripple throughout the entire Army training base. This thesis gathers and analyzes historical recruit and in-processing data for one Army training base: Fort Sill, Oklahoma. The recruit reception process is modeled as a network flow …

    nps Repository record for Analyzing soldier in-processing at the United States Army Field Artillery Training Center through simulation (opens in a new tab)

  15. A review of techniques in transportation research

    … their operations is relatively new Some of the problems encountered in transportation research are discussed along with methods for their solution,. The Hitchcock distribution problem is discussed and a sample problem solved using three different methods. The usefulness of graph theory in …

    nps Repository record for A review of techniques in transportation research (opens in a new tab)

  16. Long-term scheduling in underground coal mining using mixed binary programming

    … value. Defining the mine layout as a precedence network, with the nodes representing mining blocks, a solution procedure is developed, based on Benders' partitioning scheme. That is, the procedure iterates between two problems, namely, the master (primal) problem, solved by a combination of …

    vt Repository record for Long-term scheduling in underground coal mining using mixed binary programming (opens in a new tab)

  17. Distributed Energy-Saving Algorithms for Wireless Networks

    The rapid growth of wireless networks has led to increasing interest in designing new algorithms that can efficiently reduce the energy consumption of routers and other devices. We present a new formulation of the Network Flow problem that takes into account the energy consumption of the data …

    maynooth Download PDF for Distributed Energy-Saving Algorithms for Wireless Networks (opens in a new tab)

  18. A multilevel approach to minimal cost network flows

    … to a non-geometric long transportation problem. An introduction to multigrid is given, and specifics of how it is applied to this minimum cost network flow problem are explored. This research shows that multilevel techniques can be applied to network optimization problems. Further, since …

    nps Repository record for A multilevel approach to minimal cost network flows (opens in a new tab)

  19. Aggregate logistics optimization for a large beverage company

    … cost. It is a multi-commodity, multi-period network flow problem formulated as a linear program with 48,000 decision variables and over 16,000 constraints. Based on the LP model, COE developed a customized computer based planning tool, Aggregate Logistics Optimization Tool (ALOT). ALOT is …

    ubc Repository record for Aggregate logistics optimization for a large beverage company (opens in a new tab) Download PDF for Aggregate logistics optimization for a large beverage company (opens in a new tab)

  20. Optimization models for transport and service scheduling

    … focuses on service scheduling and transshipment problems. The study of service scheduling is motivated by decisions facing service planners, who must inspect and maintain geographically dispersed infrastructure facilities. We study the problem of deciding which operations a service unit must …

    texas Repository record for Optimization models for transport and service scheduling (opens in a new tab)

Page 1 of 3