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.
KeywordsLinear Programming Problem Lagrangian Relaxation Integer Variable Integer Programming Problem Shadow Prex
Unable to display preview. Download preview PDF.
- E.M.L. Beale (1968) Mathematical Programming in Practice (Pitmans. London).Google Scholar
- 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
- 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
- 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
- K.L. Hoffman and M.W. Padberg (1985) “LP-Based combinatorial problem solving”. This volume.Google Scholar
- 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
- A.H.G. Rinnooy and G.T. Timmer (1985) “Stochastic methods for global optimization” This volume.Google Scholar
- H.P. Williams (1985) “Model Building in Linear and Integer Programming” This volume.Google Scholar