Combinatorial Optimization
- Tín chỉ
- 3
- Bậc
- Bachelor
- Thang điểm
- 10
- Điểm qua
- 5
Mô tả
This course provides an introduction to combinatorial optimization. It discusses linear programming techniques and various fundamental graph-theoretic algorithms. This course covers, among others, shortest path algorithms, minimum spanning trees, matching, coverings and network flows.
Phân bổ thời gian
Contact time: 30 sessions Lectures: 15 ; Tutorials: 15 1 session = 90'
Nhiệm vụ sinh viên
Students must attend more than 80% of contact hours in order to be accepted to the final examination.