Sökning: "Shortest Path"

Visar resultat 1 - 5 av 40 avhandlingar innehållade orden Shortest Path.

  1. 1. An Analysis of Consequences of Land Evaluation and Path Optimization

    Författare :Rachel Mundeli Murekatete; Takeshi Shirabe; Gerhard Navratil; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Least-cost paths; Most-suitable paths; Raster cost surfaces; Raster suitability surfaces; Shortest path problem; Minimax path problem; Scales of measurement; Minsta-kostnad rutter; Mest-lämpliga rutter; Raster kostnadsytor; Raster lämplighets ytor; kortaste vägen problem; Minimax väg problem; Mätskalor; Geodesy and Geoinformatics; Geodesi och geoinformatik;

    Sammanfattning : Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. LÄS MER

  3. 2. Shortest Path Routing Modelling, Infeasibility and Polyhedra

    Författare :Mikael Call; Kaj Holmberg; Bernard Fortz; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. LÄS MER

  4. 3. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER

  5. 4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

  7. 5. Inverse Shortest Path Routing Problems in the Design of IP Networks

    Författare :Mikael Call; Kaj Holmberg; Andreas Bley; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Optimization; systems theory; Optimeringslära; systemteori;

    Sammanfattning : This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (IP) networks. In IP routing, alldata traffic is routed in accordance with an SPR protocol, e.g. OSPF. LÄS MER