Discrete Optimization
About
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.
Prerequisites and selection
Requirements
Successfully completed a first year studies within the subject Computer Science or equivalent. Specifically the course DIT600 Algorithms (or equivalent) is required. Applicants must prove their knowledge of English: English 6/English B from Swedish Upper Secondary School or the equivalent level of an internationally recognized test, for example TOEFL, IELTS.
Selection
Selection is based upon the number of credits from previous university studies.
For admission to the summer 2021 and onward the following selection applies: selection is based upon the number of credits from previous university studies, maximum 285 credits.