teaching:ipcomsoc2425
Integer Programming and Computational Social Choice 24/25
data | what was taught [resources] |
---|---|
17. 2. | Fixed dimension IPs, birds-eye overview of iterative augmentation. |
24. 2. | Iterative augmentation: Graver basis, positive sum property |
3. 3. | Iterative augmentation: convergence, (AugIP), feasibility |
10. 3. | Steinitz Lemma, basic $g_1(A)$ bound, sketch of extension to $n$-folds. |
17. 3. | Plan: Basic (AugIP) DP, DP for $n$-folds, Klein's lemma and $2$-stage norm bound |
Resources:
- [LN]: Lecture notes (hopefully continuously updated 😅). autogenerated PDF (login required)
Eventually (😅😅😅) I will post lecture notes here.
teaching/ipcomsoc2425.txt · Poslední úprava: 2025/03/21 11:15 autor: Martin Koutecky