New Techniques and Algorithms for Multiobjective and Lexicographic Goal-Based Shortest Path Problems

New Techniques and Algorithms for Multiobjective and Lexicographic Goal-Based Shortest Path Problems

Versandkostenfrei!
Versandfertig in 1-2 Wochen
52,95 €
inkl. MwSt.
PAYBACK Punkte
0 °P sammeln!
Doctoral Thesis / Dissertation from the year 2015 in the subject Computer Science - Miscellaneous, University of Málaga (University of Málaga), language: English, abstract: Shortest Path Problems (SPP) are one of the most extensively studied problems in the fields of Artificial Intelligence (AI) and Operations Research (OR). It consists in finding the shortest path between two given nodes in a graph such that the sum of the weights of its constituent arcs is minimized. However, real life problems frequently involve the consideration of multiple, and often conflicting, criteria. When multiple...