Universität Wien

510011 VU VGSCO: Mixed-Integer (Non) Linear Programming (2023W)

4.00 ECTS (2.00 SWS), SPL 51 - Doktoratsstudium Mathematik
Continuous assessment of course work
ON-SITE
Moodle

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

max. 24 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Monday 15.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 16.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Wednesday 17.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 18.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Friday 19.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Monday 22.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Monday 22.01. 15:00 - 16:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 23.01. 09:45 - 11:15 Seminarraum 11 Oskar-Morgenstern-Platz 1 2.Stock
  • Tuesday 23.01. 15:00 - 16:30 Seminarraum 7 Oskar-Morgenstern-Platz 1 2.Stock
  • Wednesday 24.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Wednesday 24.01. 15:00 - 16:30 Seminarraum 8 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 25.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 25.01. 15:00 - 16:30 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Friday 26.01. 09:45 - 11:15 Seminarraum 12 Oskar-Morgenstern-Platz 1 2.Stock
  • Friday 26.01. 15:00 - 16:30 Seminarraum 13 Oskar-Morgenstern-Platz 1 2.Stock

Information

Aims, contents and method of the course

Many large-scale problems arising in practice, such as logistics, infrastructure network design, social networks, and statistical learning, involve discrete decision variables. In recent years, the integration of theoretical and algorithmic advances in integer programming into optimization software drastically increased our ability to solve large-scale integer programs. In this course, we will cover integer programming theory and algorithms, with a particular emphasis on polyhedral combinatorics that led to these advances.

Assessment and permitted materials

Minimum requirements and assessment criteria

Examination topics

Reading list

Association in the course directory

MAMV

Last modified: Mo 01.01.2024 11:27