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 8 of 8 for “"Minimum cost network flow problem"”.

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

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

    … of catastrophic 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 …

    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)

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

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

  5. Robust Water Resource Planning at River Basins

    … water resource systems planning and management problems. We consider the problem of water resource systems planning at river basins when there are competing demands and different operating policies. Firstly, we provide a mathematical model using the minimum cost network flow problem, in which …

    concordia Download PDF for Robust Water Resource Planning at River Basins (opens in a new tab)

  6. Algorithms and Design Principles for Rural Kiosk Networks

    … KioskNet project aims to provide extremely low-cost Internet access to rural kiosks in developing countries, where conventional access technologies, \eg\, DSL, CDMA and dial-up, are currently economically infeasible. In the KioskNet architecture, an Internet-based proxy gathers data from the …

    waterloo Repository record for Algorithms and Design Principles for Rural Kiosk Networks (opens in a new tab)

  7. Active resource scheduling with equivalent tasks, unary demands and hierarchical structure capacity constraints

    … we have investigated solution approaches for the problem of scheduling of instructors (ISP) in the executive development programs offered by the Institute of Productivity through Quality at the College of Business Administration, University of Tennessee, Knoxville. There has been two principal …

    utk-theses Repository record for Active resource scheduling with equivalent tasks, unary demands and hierarchical structure capacity constraints (opens in a new tab)