Skip to main content

Integral Boundary Points of Convex Polyhedra

  • Chapter
  • First Online:
50 Years of Integer Programming 1958-2008

Abstract

Here is the story of how this paper was written. (a) Independently, Alan and Joe discovered this easy theorem: if the “right hand side” consists of integers, and if the matrix is “totally unimodular”, then the vertices of the polyhedron defined by the linear inequalities will all be integral. This is easy to prove and useful. As far as we know, this is the only part of our theorem that anyone has ever used.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A.J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proceedings Symposium Applied Mathematics 10, American Mathematical Society, 1960, pp. 113–128.

    Google Scholar 

  2. A.J. Hoffman, Total unimodularity and combinatorial theorems, Linear Algebra and its Applications 13 (1976) 103–108.

    Article  MathSciNet  Google Scholar 

  3. P.D. Seymour, Decomposition of regular matroids, Journal of Combinatorial Theory B 29 (1980) 305–359.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan J. Hoffman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoffman, A.J., Kruskal, J.B. (2010). Integral Boundary Points of Convex Polyhedra. In: Jünger, M., et al. 50 Years of Integer Programming 1958-2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_3

Download citation

Publish with us

Policies and ethics