Parametrization of discrete optimization problems, subdeterminants and matrix-decomposition
Video: https://vimeo.com/216507007 The central goal of this talk is to identify parameters that explain the complexity of Integer linear programming defined as follows: Let P be a polyhedron. Determine an integral point in P that maximizes a linear function. It is obvious that the number of integer variables is such …