An Introduction to Basic Algorithms to Solve Environmental and Resource Management Optimization Problems
Eine Einführung in grundlegende Algorithmen zur Lösung von Optimierungsproblemen im Umwelt- und Ressourcenmanagement
6 CPWinterEN
Contents
An introduction to basic algorithms which can be used for typical optimization problems in environmental and research management. For example, where to place wind turbines in a given landscape while optimizing given parameters e.g. maximizing energy generation or minimizing biodiversity disturbance. We start with a short introduction / refresher of basic programming principles and focus during the course on understanding and enabling the use of existing algorithms as graph algorithms or when to use other approximation algorithms like greedy. All algorithms are introduced and discussed in the context of environmental and resource related optimization problems. 1. Basic programming principles 2. Graph algorithms 3. Greedy algorithms 4. Knapsack problem 5. Dynamic Programming 6. Simulated Annealing
Learning outcomes
After participating in the module, students should • have a basic understanding of programming principles, • have a basic understanding of graphs and graph algorithm • be able to identify optimization problems in the field of environmental and research management and • be able to match real world optimization problems to introduced algorithmic solutions.
Assessment
Practical project presentation, 30 min (50%) in groups oral examination, 20 min. (50%)
Literature (1)
- "The Algorithm Design MANUAL" by Steven S. Skiena (Springer); ”Algorithms Unplugged” by Berthold Vöcking et al (Springer);” Or the German Version: "Taschenbuch der Algorithmen" by Berthold Vöcking et al
Source: BTU's module description · retrieved 29 Sep 2026Original