Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”

Abstract

An error in the proof, and in the statement of a generalization, of the result that submodular setfunctions can be minimized over the subsets with odd cardinality is corrected.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    M. Grötschel, L. Lovász andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169–197.

    MATH  MathSciNet  Google Scholar 

  2. [2]

    P. M. Jensen andB. Korte, Complexity of matroid property algorithms,SIAM J. Computing 11 (1982), 184–190.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    M. W. Padberg andM. R. Rao, Odd minimum cut-sets andb-matchings,Math. Oper. Res. 7 (1982), 67–80.

    MATH  MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Grötschel, M., Lovász, L. & Schrijver, A. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”. Combinatorica 4, 291–295 (1984). https://doi.org/10.1007/BF02579139

Download citation

AMS subject classification (1980)

  • 90 C XX
  • 05 C XX
  • 90 C 25
  • 90 C 10