|
|
|
||
|
The lecture studies optimization problems with discrete (integer) variables. Integer programming problems
often arise in practical problems and many problems can be formulated in terms of integer programming.
Due to high computational complexity, it is still a challenge and in focus of current research.
Remark: The course can be tought once in two years.
Last update: Hladík Milan, prof. Mgr., Ph.D. (07.04.2016)
|
|
||
|
Students will learn not only the classical results in integer programming, but also the current trends. Absolvents should be able to apply their knowledge in practice and also do the reserach in this field. Last update: Hladík Milan, prof. Mgr., Ph.D. (07.04.2016)
|
|
||
|
To pass the tutorial, the student has to obtain at least 50 % of the points in each set of homework problems assigned during the semester. Last update: Garajová Elif, Mgr., Ph.D. (13.02.2019)
|
|
||
|
[1] G.L. Nemhauser, L.A. Wolsey. Integer and combinatorial optimization. Wiley, New York, 1999. [2] A. Schrijver. Theory of linear and integer programming. Repr. Wiley, Chichester, 1998. [3] L.A. Wolsey. Integer programming. Wiley, Chichester, 1998. Last update: Hladík Milan, prof. Mgr., Ph.D. (07.04.2016)
|
|
||
|
The exam is oral and consists of questions on subjects covered by the lectures. The exam can have the present or the distant form. Last update: Hladík Milan, prof. Mgr., Ph.D. (24.09.2020)
|
|
||
It is assumed that the students have a basic knowledge of linear programming. Last update: Hladík Milan, prof. Mgr., Ph.D. (14.02.2023)
|