Many combinatorial optimization problems can be reduced to the LP problems using the results from the field called “polyhedral combinatorics”. The main goal of polyhedral combinatorics is to represent the convex envelope of feasible points of the given combinatorial problem in the form of a system of linear equalities and inequalities. Obtained by this way LP problems often have an exponentially growing number of constraints. We know that at each step of ellipsoid method for LP we have to use no more than one constraint from the set of constraints which are not fulfilled at current point. In many cases the problem of finding such a constraint can be formulated in the form of a new combinatorial (in some sense polar to the original) optimization problem (so-called separation problem).
CITATION STYLE
Shor, N. Z. (1998). The Role of Ellipsoid Method for Complexity Analysis of Combinatorial Problems (pp. 227–263). https://doi.org/10.1007/978-1-4757-6015-6_7
Mendeley helps you to discover research relevant for your work.