Skip to main content
SpringerLink
Log in
Book cover

Mathematical Programming at Oberwolfach II pp 64–69Cite as

A polynomial-time test for total dual integrality in fixed dimension

  • Chapter
  • First Online:

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 22))

Abstract

In this note we show that, for any fixed number r, there exists a polynomial-time algorithm to test whether a given system of linear inequalities Ax≤b is totally dual integral, where A is an integer matrix of rank r.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Chandrasekharan, “Polynomial algorithms for totally dual integral systems and extensions”, Annals of Discrete Mathematics 11 (1981) 39–51.

    MathSciNet  Google Scholar 

  2. R. Chandrasekharan and S. Shirali, “Total weak unimodularity: Testing and applications”, Report University of Texas at Dallas, 1981.

    Google Scholar 

  3. J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs”, Annals of Discrete Mathematics 1 (1977) 185–204.

    Article  MathSciNet  Google Scholar 

  4. F.R. Giles and W.R. Pulleyblank, “Total dual integrality and integer polyhedra”, Linear Algebra and Its Applications 25 (1979) 191–196.

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Kannan and A. Bachem, “Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix”, SIAM Journal on Computing 8 (1979) 499–507.

    Article  MathSciNet  MATH  Google Scholar 

  6. L.G. Khachiyan, “A polynomial algorithm in linear programming”, Doklady Akademii Nauk SSSR 244 (1979) 1093–1096 (English translation: Soviet Mathematics Doklady 20 (1979) 191–194).

    MathSciNet  MATH  Google Scholar 

  7. H.W. Lenstra, Jr., “Integer programming with a fixed number of variables”, Mathematics of Operations Research 8 (1983) 538–548.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Schrijver, “On total dual integrality”, Linear Algebra and Its Applications 38 (1981) 27–32.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    W. Cook

  2. Analizis I. tszk., Eötvös Lorand Tudományegyetem, Muzeum krt. 6-8, H-1088, Budapest, Hungary

    L. Lovász

  3. Department of Econometrics, Tilburg University, P.O. Box 90153, Tilburg, Holland

    A. Schrijver

Authors
  1. W. Cook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Lovász
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Schrijver
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Korte Klaus Ritter

Rights and permissions

Reprints and permissions

Copyright information

© 1984 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Cook, W., Lovász, L., Schrijver, A. (1984). A polynomial-time test for total dual integrality in fixed dimension. In: Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach II. Mathematical Programming Studies, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121008

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00914-3

  • Online ISBN: 978-3-642-00915-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation