Skip to main content
SpringerLink
Log in

On some characterisations of totally unimodular matrices

  • Published:
Mathematical Programming Submit manuscript

Abstract

A characterisation of totally unimodular matrices is derived from a result of Hoffman and Kruskal. It is similar in spirit to a result of Baum and Trotter. Its relation with some other known characterisations is discussed and in the particular case where the matrices have (0, 1) entries, we derive some properties of the associated unimodular hypergraphs. Similar results for balanced and perfect matrices are also reviewed.

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

Access this article

Log in via an institution

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. Z. Baranyai, “The edge-coloring of complete hypergraphs, I”,Journal of Combinatorial Theory B26 (1979) 276–294.

    Google Scholar 

  2. S. Baum and L.E. Trotter, “Integer rounding and polyhedral decomposition for totally unimodular systems”, in: R. Henn, B. Korte and W. Oettli, eds.,Arbeitstagung über Operations Research und Optimierung (Springer, Berlin, 1978) pp. 15–23.

    Google Scholar 

  3. S. Baum and L.E. Trotter, “Integer rounding for polymatroid and branching optimization problems, Bonn Univ. O.R./Econ. Inst. Techn. Report no. 78120-OR.

  4. C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973).

    Google Scholar 

  5. C. Berge, “Balanced matrices”,Mathematical Programming 2 (1972) 19–31.

    Google Scholar 

  6. C. Berge, “Notes sur les bonnes colorations d'un hypergraphe”,Cahiers du Centre d'Etudes de Recherche Opérationnelle 15 (1973) 219–223.

    Google Scholar 

  7. A. Ghouila-Houri, “Caractérisation des matrices totalement unimodulaires”,Comptes rendus de l'Academie des Sciences, Paris 254 (1962) 1192.

    Google Scholar 

  8. M. Gondran, “Matrices totalement unimodulaires”,Bulletin EDF, Série C, 1 (1973) 55–74.

    Google Scholar 

  9. A.J. Hoffman and J.B. Kruskal, “Integral boundary points of convex polyhedra”, in: H.W. Kuhn and A.W. Tucker, eds.,Linear inequalities and related systems (Princeton Univ. Press, Princeton, NJ, 1956) pp. 223–246.

    Google Scholar 

  10. L. Lovasz, “Minimax theorems for hypergraphs”, in: C. Berge and D. Ray-Chaudhuri, eds.,Hypergraph Seminar (Springer, Berlin, 1974) pp. 111–126.

    Google Scholar 

  11. M.W. Padberg, “Characterisations of totally unimodular, balanced and perfect matrices”, in: B. Roy, ed.,Combinatorial programming: Methods and applications (D. Reidel Publ., Dordrecht, Holland, 1975) pp. 275–284.

    Google Scholar 

  12. M.W. Padberg, “A note on the total unimodularity of matrices”,Discrete Mathematics 14 (1976) 273–278.

    Google Scholar 

  13. A. Tamir, “On totally unimodular matrices”,Networks 6 (1976) 373–382.

    Google Scholar 

  14. D. de Werra, “Equitable colorations of graphs”,Revue Française d'Informatique et de Recherche Opérationnelle R-3 (1971) 3–8.

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    D. de Werra

Authors
  1. D. de Werra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Werra, D. On some characterisations of totally unimodular matrices. Mathematical Programming 20, 14–21 (1981). https://doi.org/10.1007/BF01589329

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation