The ellipsoid method and its consequences in combinatorial optimization

L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is an adaptation of an algorithm proposed by Shor for non-linear optimization problems. In this paper we show that the method also yields interesting results in combinatorial optimization. Thus it yields polynomial algorithms for vertex packing in perfect graphs; for the matching and matroid intersection problems; for optimum covering of directed cuts of a digraph; for the minimum value of a submodular set function; and for other important combinatorial problems. On the negative side, it yields a proof that weighted fractional chromatic number is NP-hard.

[1]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[5]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[6]  B. Rothschild,et al.  MULTICOMMODITY NETWORK FLOWS. , 1969 .

[7]  N. Z. Shor.  Convergence rate of the gradient descent method with dilatation of the space , 1970 .

[8]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[9]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[10]  T. C. Hu.  Two-commodity cut-packing problem , 1973, Math. Program..

[11]  D. R. Fulkerson,et al.  Packing rooted directed cuts in a weighted directed graph , 1974, Math. Program..

[12]  L. Lovász.  2-Matchings and 2-covers of hypergraphs , 1975 .

[13]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[14]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory, Ser. B.

[15]  C. Lucchesi,et al.  A Minimax Theorem for Directed Graphs , 1978 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Paul D. Seymour,et al.  A two-commodity cut theorem , 1978, Discret. Math..

[18]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[19]  Alexander Schrijver.  A counterexample to a conjecture of Edmonds and Giles , 1980, Discret. Math..

[20]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[21]  András Frank,et al.  On the orientation of graphs , 1980, J. Comb. Theory, Ser. B.

[22]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[23]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[24]  András Frank.  How to make a digraph strongly connected , 1981, Comb..

[25]  P. Gács,et al.  Khachiyan’s algorithm for linear programming , 1981 .