Skip to main content
Log in

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

  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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. P. M. Jensen andB. Korte, Complexity of matroid property algorithms,SIAM J. Computing 11 (1982), 184–190.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and 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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579139

AMS subject classification (1980)

Navigation