Skip to main content
Springer Nature Link
Log in

Investigation of some branch and bound strategies for the solution of mixed integer linear programs

  • Published:
Mathematical Programming Submit manuscript

Abstract

The branch and bound method of solving the mixed integer linear programming problem is summarized. The flexibility of this technique is examined through experiments with different branching and subproblem selection strategies, and the efficacy of these various heuristics is assessed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Benichou et al., “Experiments in mixed-integer linear programming”,Mathematical Programming 1 (1971) 76–94.

    Google Scholar 

  2. N.J. Driebeek, “An algorithm for the solution of mixed integer programming problems”,Management Science 12 (1966) 576–587.

    Google Scholar 

  3. E.L. Lawler and D.E. Wood, “Branch and bound methods — a survey”,Operations Research 14 (1966) 699–719.

    Google Scholar 

  4. Mathematical Programming System Extended (MPSX), Mixed Integer Programming (MIP), Program Number 5734—XM4 (IBM World Trade Corporation, New York, 1971).

  5. OPHELIE MIXED, Mixed Integer Programming System, User Information Manual (SEMA (METRA International), Paris, 1970).

  6. J.A. Tomlin, “Branch and bound methods for integer and non-convex programming”, in:Integer and non-linear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970) 437–450.

    Google Scholar 

  7. UMPIRE System Users' Guide (Scientific Control Systems Ltd., London, 1970).

  8. XDLA Linear Programming Mk3 (Technical Publications Service, ICL, London, 1971).

Download references

Author information

Authors and Affiliations

  1. Brunel University, Uxbridge, Middlesex, Great Britain

    G. Mitra

  2. UNICOM Consultants, London, Great Britain

    G. Mitra

Authors
  1. G. Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitra, G. Investigation of some branch and bound strategies for the solution of mixed integer linear programs. Mathematical Programming 4, 155–170 (1973). https://doi.org/10.1007/BF01584658

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords