Abstract
This paper presents a “branch and bound” method for solving mixed integer linear programming problems. After briefly discussing the bases of the method, new concepts called pseudo-costs and estimations are introduced. Then, the heuristic rules for generating the tree, which are the main features of the method, are presented. Numerous parameters allow the user for adjusting the search strategy to a given problem.
This method has been implemented in the IBM Extended Mathematical Programming System in order to solve large mixed integer L. P. problems. Numerical results making comparisons between different choices of rules are provided and discussed.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
E.M.L.Beale and R.E.Small, “Mixed integer programming by a branch and bound technique”, Proc. IFIP Congress 65, ed. W.H.Kalenich, Vol. 2 (1966) pp. 450–451.
R.J.Dakin, “A tree search algorithm for mixed integer programming problems”,The Computer Journal 8 (1965) 250–255.
N.J.Driebeek, “An algorithm for the solution of mixed integer programming problems”,Management Science 12 (1966) 576–587.
P. Herve, “Resolution des programmes lineaires a variables mixtes par la procedure SEP”,METRA 6, No. 1–67.
A.H.Land and A.G.Doig, “An automatic method of solving discrete programming problems”,Econometrica 28 (1960) 497–520.
Carlton E.Lemke and Kurt Spielberg, “Direct search zero–one and mixed integer programming”, Report L 3, IBM Data Processing Division, New York Scientific Center (June, 1966).
B.Roy, R.Benayoun and J.Tergny, “De la procédure SEP au programme Ophélie mixte”,SEMA (1969).
R.Shareshian and K.Spielberg, “On integer and mixed integer programming and related areas in Mathematical programming”, IBM N.Y. Scientific Center (1966).
J.A.Tomlin, “Branch and bound method for integer and non-convex programming”, NATO International Summer School on integer and non-linear programming (1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benichou, M., Gauthier, J.M., Girodet, P. et al. Experiments in mixed-integer linear programming. Mathematical Programming 1, 76–94 (1971). https://doi.org/10.1007/BF01584074
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584074