|
|
|
||
Last update: prof. Mgr. Milan Hladík, Ph.D. (07.04.2016)
|
|
||
Last update: prof. Mgr. Milan Hladík, 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: Mgr. Elif Garajová, Ph.D. (13.02.2019)
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: prof. Mgr. Milan Hladík, Ph.D. (07.04.2016)
[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: prof. Mgr. Milan Hladík, Ph.D. (24.09.2020)
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: prof. Mgr. Milan Hladík, Ph.D. (14.02.2023)
It is assumed that the students have a basic knowledge of linear programming. |