Search for dissertations about: "Shortest path problem"
Showing result 1 - 5 of 28 swedish dissertations containing the words Shortest path problem.
-
1. An Analysis of Consequences of Land Evaluation and Path Optimization
Abstract : 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. READ MORE
-
2. Shortest Path Routing Modelling, Infeasibility and Polyhedra
Abstract : 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. READ MORE
-
3. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
Abstract : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. READ MORE
-
4. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks
Abstract : Reducing the dependence on fossil fuels in the transport sector is crucial to have a realistic chance of halting climate change. The automotive industry is, therefore, transitioning towards an electrified future at an unprecedented pace. READ MORE
-
5. Constraint Programming Methods for Optimization of Single Shortest Path Routing
Abstract : 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. READ MORE