Aarhus Universitets segl

Functions related to the complexity of integer optimization

Robert Weismantel (ETH Zurich)
Onsdag 9. maj 2018 14:00–15:00 Department of Economics
In this talk we study functions in relationship with discrete optimization problems. Among them are some classical ones such as the running time function or the proximity function or the integer Caratheodory number. Other interesting functions are the row-number function or the sparsity function. The central message of the talk is that the complexity of linear integer optimization problems often nicely translates into functions that only depend on the number of variables, the number of rows, the infinity norm of the constraint matrix or the maximal absolute value of the determinant of a square submatrix of the constraint matrix.
Organiseret af: Kent Andersen
Kontakt: Kent Andersen Revideret: 01.05.2018