October 08, 2019, 9:00 AM - 10:00 AM
Auditorium (Amphitheatre Banque Nationale)
Click here for map.
Robert Weismantel, ETH Zurich
For an integer optimization problem (IP), one important data parameter is the maximum absolute value among all square submatrices of the constraint matrix.
We present recent developments about this topic. In particular we show that almost all problems (IP) with constant data parameter can be solved in polynomial time.