SubjectsSubjects(version: 850)
Course, academic year 2019/2020
   Login via CAS
Integer Programming - NOPT016
Title in English: Celočíselné programování
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2019 to 2019
Semester: summer
E-Credits: 6
Hours per week, examination: summer s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: Czech, English
Teaching methods: full-time
Guarantor: doc. Mgr. Milan Hladík, Ph.D.
Class: Informatika Mgr. - Diskrétní modely a algoritmy
Classification: Informatics > Optimalization
Annotation -
Last update: doc. Mgr. Milan Hladík, Ph.D. (07.04.2016)
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.
Aim of the course -
Last update: doc. 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.

Course completion requirements -
Last update: Mgr. Elif Garajová (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.

Literature -
Last update: doc. 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.

Requirements to the exam -
Last update: doc. Mgr. Milan Hladík, Ph.D. (13.02.2019)

The exam is oral and consists of questions on subjects covered by the lectures.

Syllabus -
Last update: doc. Mgr. Milan Hladík, Ph.D. (07.04.2016)
  • Formulation of integer problems
  • Integer polyhedron, unimodular matrices, NP-completeness
  • Cutting planes and branch & bound methods
  • The first and second Gomory algorithms
  • Preprocessing. Heuristics
  • Knapsack problem
  • Set covering
  • Travelling salesman problem

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html