discipline

Mathematics

subject

Integer Programming I.

lecturers

László Szegő

credits

2

period

1

curriculum

Integer programming formulations. Polyhedral combinatorics. General methods for solving IP problems: Lagrangian relaxiation, subgradient method, branch and bound, branch and cut, Gomory's cutting planes method. Special methods for the travelling salesman problem.

literature

Cook,  Cunningham, Pulleyblank, and Schrijver: Combinatorial Optimization, Wolsey: Integer Programming

form of tuition

Lectures

mode of assessment

written exam