MathematicsComputer Science

The ellipsoid method and its consequences in combinatorial optimization

M. Grötschel, L. Lovász, A. Schrijver

1981COMBINATORICA

DOI: 10.1007/bf02579273

tlooto Summary

The method 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, and for the minimum value of a submodular set function.

Abstract

Abstract is not available.

Citation format

GRÖTSCHEL, M.; LOVÁSZ, L.; SCHRIJVER, A. The ellipsoid method and its consequences in combinatorial optimization. COMBINATORICA, 1981, 1: 169–197.