Skip to main content
SpringerLink
Log in
Book cover

Approaches to Integer Programming pp 137–179Cite as

On the group problem for mixed integer programming

  • Chapter
  • First Online:

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

Abstract

A theory is developed for a group problem arising from mixed integer programming. This theory gives descriptions of functions on the unit hypercube from which cutting planes can be constructed for any mixed integer program. Methods for generating such functions are given.

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. E. Balas, “Intersection cuts—A new type of cutting planes for integer programming”, Operations Research 19 (1971) 19–39.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Burdet, “On the algebra and geometry of integer programming cuts”, Management Sciences Report No. 291, Carnegie-Mellon University, Pittsburgh, Pa. (1972).

    Google Scholar 

  3. G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, N.J., 1962).

    Google Scholar 

  4. F. Glover, “Cut search methods in integer programming”, Mathematical Programming 3 (1972) 86–100.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.E. Gomory, “Some polyhedra related to combinatorial problems”, Linear Algebra and Its Applications 2 (1969) 451–558.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedra I”, Mathematical Programming 3 (1972) 23–85.

    Article  MATH  MathSciNet  Google Scholar 

  7. R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedra II”, Mathematical Programming, to appear.

    Google Scholar 

  8. G.A. Gorry, W.D. Northup and J.F. Shapiro, “Computational experience with a group theoretic integer programming algorithm”, Mathematical Programming 4 (1973) 171–192.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.H. Griesmer and R.D. Jenks, “The SCRATCHPAD System”, Proceedings of ONLINE 72. Brunel University, Oxbridge, Middlesex, England, September 4–7, 1972. (Also available as IBM Research Report RC 3925).

    Google Scholar 

  10. T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, “The double description method”, in: H.W. Kuhn and A.W. Tucker, eds., Contributions to the theory of games, Vol. II, Annals of Mathematics Study No. 28 (Princeton University Press, Princeton, N.J., 1953) 51–73.

    Google Scholar 

  11. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, N.J., 1970).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., USA

    Ellis L. Johnson

Authors
  1. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. L. Balinski

Rights and permissions

Reprints and permissions

Copyright information

© 1974 The Mathematical Programming Society

About this chapter

Cite this chapter

Johnson, E.L. (1974). On the group problem for mixed integer programming. In: Balinski, M.L. (eds) Approaches to Integer Programming. Mathematical Programming Studies, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120692

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00739-2

  • Online ISBN: 978-3-642-00740-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation