Integer Programming

  • E. M. L. Beale
Part of the NATO ASI Series book series (volume 15)


Following an introduction, which discusses the motivation for studying integer programming, the relevance of computational complexity and the relative merits of integer and dynamic programming, the branch and bound method is introduced in general terms. Various types of global entity to which it can be applied are introduced. These are integer variables, semicontinuous variables, special ordered sets and chains of linked ordered sets. A discussion of the algorithmic details follows. Finally, various approaches to automatic model reformulation are discussed: this seems to be the most important current area of integer programming research.


Linear Programming Problem Lagrangian Relaxation Integer Variable Integer Programming Problem Shadow Prex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. E.M.L. Beale (1968) Mathematical Programming in Practice (Pitmans. London).Google Scholar
  2. E.M.L. Beale (1980) “Branch and bound methods for numerical optimization of non-convex functions” COMPSTAT 80 Proceedings in Computational Statistics Edited by M.M. Barritt and D. Wishart pp 11–20 (Physica Verlag. Wien).Google Scholar
  3. E.M.L. Beale (1983) “A mathematical programming model for the long-term development of an off-shore gas field” Discrete Applied Mathematics 5 pp 1–9.CrossRefGoogle Scholar
  4. E.M.L. Beale and J.J.H. Forrest (1976) “Global optimization using special ordered sets” Mathematical Programming 10 pp 52–69.CrossRefzbMATHMathSciNetGoogle Scholar
  5. E.M.L. Beale and J.A. Tomlin (1970) “Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables” in Proceedings of the Fifth International Conference on Operational Research Ed. J. Lawrence pp 447–454. (Tavistock Publications. London).Google Scholar
  6. A.L. Brearley, G. Mitra and H.P. Williams (1975) “Analysis of mathematical programming problems prior to applying the simplex method.” Mathematical Programming 8 pp 54–83.CrossRefzbMATHMathSciNetGoogle Scholar
  7. H. Crowder, E.L. Johnson and M.W. Padberg (1983) “Solving large-scale zero-one linear programming problems” Operations Research 31 pp 803–834.CrossRefzbMATHGoogle Scholar
  8. N. Driebeek (1966) “An algorithm for the solution of mixed integer programming problems” Management Science 12 pp 576–587.CrossRefGoogle Scholar
  9. J.J.H. Forrest, J.P.H. Hirst and J.A. Tomlin (1974) “Practical solution of large mixed integer programming problems with UMPIRE” Management Science 20 pp 736–773.CrossRefzbMATHMathSciNetGoogle Scholar
  10. A.M. Geoffrion and R.E. Marsten (1972) “Integer Programming Algorithms: A framework and state-of-the-art-survey” Management Science 18 pp 465–491.CrossRefzbMATHMathSciNetGoogle Scholar
  11. R.E. Gomory (1958) “Outline of an algorithm for integer solutions to linear programs” Bulletin of the American Mathematical Society 64 pp-275–278.CrossRefzbMATHMathSciNetGoogle Scholar
  12. A.H. Land and S. Powell (1979) “Computer codes for problems of integer programming” in Annals of Discrete Mathematics 5; Discrete Optimization Edited by P.L. Hammer, E.L. Johnson and B.H. Korte. pp 221–269 (North Holland Publishing Company. Amsterdam).Google Scholar
  13. K.L. Hoffman and M.W. Padberg (1985) “LP-Based combinatorial problem solving”. This volume.Google Scholar
  14. J.D.C. Little, K.C. Murty, D.W. Sweeney and C. Karel (1963) “An algorithm for the traveling salesman problem” Operations Research 11 pp 972–989.CrossRefzbMATHGoogle Scholar
  15. H.M. Markowitz and A.S. Manne (1957) “On the solution of discrete programming problems” Econometrica 25 pp 84–110.CrossRefzbMATHMathSciNetGoogle Scholar
  16. C.E. Miller (196 3) “The simplex method for local separable programming” in Recent Advances in Mathematical Programming Edited by R.L. Graves and P. Wolfe pp 89–100 (McGraw Hill. New York).Google Scholar
  17. A.H.G. Rinnooy and G.T. Timmer (1985) “Stochastic methods for global optimization” This volume.Google Scholar
  18. J.A. Tomlin (19 71) “An improved branch and bound method for integer programming” Operations Research 19 pp 1070–1075.CrossRefMathSciNetGoogle Scholar
  19. H.P. Williams (1978) Model Building in Mathematical Programming (Wiley. Chichester).zbMATHGoogle Scholar
  20. H.P. Williams (1985) “Model Building in Linear and Integer Programming” This volume.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • E. M. L. Beale
    • 1
  1. 1.Scicon LimitedBrick Close, Kiln FarmMilton KeynesGreat Britain

Personalised recommendations