SubjectsSubjects(version: 837)
Course, academic year 2018/2019
   Login via CAS
Mathematical Programming and Polyhedral Combinatorics - NOPT034
Title in English: Matematické programování a polyedrální kombinatorika
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/1 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Guarantor: prof. RNDr. Martin Loebl, CSc.
doc. Mgr. Petr Kolman, Ph.D.
Class: Informatika Mgr. - Diskrétní modely a algoritmy
Classification: Informatics > Discrete Mathematics, Optimalization
Annotation -
Last update: T_KAM (20.04.2008)
More advanced topics are treated here, e.g. the ellipsoid method, cutting planes algorithms, mutlicommodity flow problems.
Aim of the course -
Last update: T_KAM (20.04.2008)

More advanced topics are treated here, e.g. the ellipsoid method, cutting planes algorithms, mutlicommodity flow problems.

Literature - Czech
Last update: doc. Mgr. Milan Hladík, Ph.D. (25.04.2012)

Základní:

P. Kolman: Polynomiální algoritmy pro lineární­ programování­, http://kam.mff.cuni.cz/~kolman/polyLP.pdf

M. Grotschel, L. Lovasz, A. Schrijver: Geometric Algorithms and Combinatorial Optimization

Rozšiřující:

A. Schrijver: Theory of linear and integer programming, Wiley, Chichester, 1986

W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, A. Schrijver: Combinatorial Optimization, John Wiley, 1997

B. Korte, J. Vygen: Combinatorial Optimization, Springer, 2000

A. Schrijver: Combinatorial Optimization (3 volume, A,B, & C)

Syllabus -
Last update: doc. Mgr. Petr Kolman, Ph.D. (26.09.2013)

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