A large number of problems arising in practical scenarios like communication, transportation, planning, logistics etc. can be formulated as discrete linear optimization problems. This course briefly introduces the theory of such problems. We develop a toolkit to model real-world problems as (discrete) linear programs. We also explore several ways to find integer solutions such as cutting planes, branch & bound, and column generation.
Throughout the course, we learn these skills by modeling and solving, for example, scheduling, packing, matching, routing, and network-design problems. We focus on translating practical examples into mixed-integer linear programs. We learn how to use solvers (such as CPLEX and Gurobi) and tailor the solution process to certain properties of the problem.
This course consists of two phases:
- One week Mon-Fri (full day) of lectures and practical labs during Sep 26–30, 2022.
- An individual project period: One project has to be modeled, implemented, and solved individually or in a group of at most two students. The topic will be either developed with or provided by the lecturers. The project including the implementation has to be presented before the beginning of the winter semester.
There are no prerequisites except some basic programming skills to participate.
Important: please register for this course by September 1, 2022 by Email to Felix Hommelsheim (fhommels@uni-bremen.de)
Anmeldemodus
Die Auswahl der Teilnehmenden wird nach der Eintragung manuell vorgenommen.
Nutzer/-innen, die sich für diese Veranstaltung eintragen möchten,
erhalten nähere Hinweise und können sich dann noch gegen eine Teilnahme entscheiden.
