|
||
Last update: RNDr. Jan Hric (12.05.2022)
|
|
||
Last update: RNDr. Jakub Bulín, Ph.D. (06.05.2024)
Understand the main principles of various exact optimization methods based on linear programming and combinatorial optimization with emphasis on large-scale instances. Learn how to apply these methods in practice.
|
|
||
Last update: RNDr. Jakub Bulín, Ph.D. (13.05.2022)
Students are expected to implement practical homework assignments and pass theoretical examination. The nature of homework assignments excludes the possibility of repeated attempts to get credit. |
|
||
Last update: RNDr. Jakub Bulín, Ph.D. (13.05.2022)
Wolsey, Laurence A. Integer programming. Vol. 42. New York: Wiley, 1998.
Cunningham, Cook, Pulleyblank, Schrijver. Combinatorial optimization, John Wiley & Sons, 1997
Kochenderfer, Mykel J., and Tim A. Wheeler. Algorithms for optimization. MIT Press, 2019.
Desaulniers, Guy, Jacques Desrosiers, and Marius M. Solomon, eds. Column generation. Vol. 5. Springer Science & Business Media, 2006. |
|
||
Last update: RNDr. Jakub Bulín, Ph.D. (13.05.2022)
Knowledge of the basics of linear programming and duality will be expected, recommended prerequisite: Linear Programming and Combinatorial Optimization (NOPT048).
The course is taught bi-yearly, alternating with the course Large-scale optimization: Metaheuristics (NOPT061). |