|
|
Graph Routing and applications- Person in charge
- Prof. Dr. Francisco Javier Zaragoza Martínez
- Details
- Vorlesung
4 cred.h, ECTS studies, ECTS credits: 5, Sprache Englisch
- Fields of study
- WPF TM-BA ab 5
WPF CAM-MA-NASi ab 1
WPF CAM-MA-Opti ab 1
WPF M-BA ab 5
WPF WM-BA ab 5
WPF M-BA ab 5
WPF M-BA ab 5
- Contents
- The origins of graph theory are usually traced back to Euler's solution to the famous amusement known as the Königsberg bridges problem, that is, the problem of starting at some point, traversing each bridge exactly once, and returning to the original point. Since then, numerous generalizations and variants of this problem have been proposed. In this course we are going to present some basic graph routing problems (known as the postman problem and the traveling salesman problem), we are going to cover the necessary graph theoretical concepts and mathematical programming techniques used to model these problems (usually as linear integer programs), and we are going to describe algorithmic methods for their solution.
- ECTS information:
- Credits: 5
- Additional information
- Assigned lectures
- UE: Tutorial to Graph Routing and applications
-
Lecturer: Prof. Dr. Francisco Javier Zaragoza Martínez
- Verwendung in folgenden UnivIS-Modulen
- Startsemester WS 2019/2020:
- Graph Routing and applications (GrRaA)
- Department: Controlling CAM
Courses
|
|
|