|
|
 |
|
Jeudi 21 Mai
| Heure: |
10:30 - 12:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Integer programs with bounded subdeterminants: solving structured cases |
| Description: |
Stefan Kober It is a notorious open question whether integer programs (IPs), with an integer constraint matrix M whose subdeterminants are all bounded by a constant in absolute value, can be solved in polynomial time. We give an overview on recent progress towards this question and the rich combinatorial structures hidden within. Further, we show how to solve such IPs if the constraint matrix fulfills certain further structural conditions.
This talk is based on the following papers:
Aprile, M., Fiorini, S., Joret, G., Kober, S., Seweryn, M. T., Weltge, S., & Yuditsky, Y. Integer programs with nearly totally unimodular matrices: the cographic case. [SODA 2025]
Fiorini, S., Kober, S., Seweryn, M. T., Shantanam, A., & Yuditsky, Y. Face covers and rooted minors in bounded genus graphs. [preprint 2025]
Kober, S. Totally ?-Modular IPs with Two Non-zeros in Most Rows. [IPCO 2025] |
|
|
