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 2 of 2 for “"Lokale Suche"”.
-
Effiziente lokale Suche für vehicle routing und Scheduling-Probleme mit Ressourcenbeschränkungen
The development of efficient heuristics for Vehicle Routing and Scheduling Problems has been the subject of many research activities during the last decades. Most of the algorithms published up to now can only be applied to instances of problem types specific to the algorithm. The according lack of …
-
The complexity of Nash Equilibria, Local Optima, and Pareto-Optimal solutions
An instance of a combinatorial optimization problem is usually described by an objective function that is to be optimized over a set of feasible solutions. The decisions that economic entities face every day are more complex for various reasons: In many situations, there is more than one objective …