Discrete Optimization - University of Gothenburg Till startsida
Sitemap
To content Read more about how we use cookies on gu.se

Discrete Optimization

Master's level | 7.5 credits | Course code: DIT370

The course is not given as a stand-alone course this academic year, but can be included in the program/course package. For information contact the department.

About the Course

In this course you learn specific methods to model and solve problems where some objective function shall be maximized or minimized under side constraints, especially for discrete problems, i.e., such with countable objects and integer variables. After the course you should be able to; dualize optimization problems (LP dual, Lagrange dual) and use the dual forms, e.g., to obtain bounds, apply techniques for the design of exact algorithms (dynamic programming, cutting planes, column generation, parameterized algorithms) to concrete problems, distinguish approximation algorithms from heuristics, apply several heuristic approaches (e.g., branch-and-bound) as well as design techniques for approximation algorithms, to concrete problems distinguish approximation algorithms from heuristics, apply several heuristic approaches (e.g., branch-and-bound) as well as design techniques for approximation algorithms, to concrete problems etc.

More Information

http://gul.gu.se/public/cour...

Show more

Course Syllabus

DIT370

Tuition Fee

Please contact the department.
EU/EEA citizens, Swedish residence permit holders and exchange students do not pay fees. More information on: http://www.universityadmissions.se

Study Guidance

E-post: svl@cse.gu.se

Department

Department of Computer Science and Engineering
41296 Göteborg

Visiting address: Rännvägen 6 B

Page Manager: Pontus Sundén
Last update: 2/18/2020 2:41 PM

Tell a friend about this page
Print version

Page Manager: Pontus Sundén|Last update: 10/16/2018
Share:

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?