Skip to main content
SpringerLink
Log in

Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Typical implementations of branch-and-bound for integer linear programs choose to branch on single variables. In this paper we explore the use of general disjunctions for branching when solving linear programs with general-integer variables. We give computational results that show that the size of the enumeration tree can be greatly reduced by branching on such disjunctions rather than on single variables.

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

Access this article

Log in via an institution

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. E. Balas, S. Ceria, and G. Cornuéjols, “Mixed 0-1 programming by lift-and-project in a branch-and-cut framework, ” Management Science, vol. 42, pp. 1229–1246, 1996.

    Google Scholar 

  2. E. Balas, S. Ceria, G. Cornuéjols, and N. Natraj, “Gomory cuts revisited, ” OR Letters, vol. 19, 1996.

  3. R.E. Bixby, S. Ceria, C.M. McZeal, and M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0., 1998.

  4. S. Ceria, C. Cordier, H. Marchand, and L.A. Wolsey, “Cutting planes for integer programs with general integer variables, ” Mathematical Programming, vol. 81, pp. 201–214, 1998.

    Google Scholar 

  5. W. Cook, T. Rutherford, H.E. Scarf, and D. Shallcross, “An implementation of the generalized basis reduction algorithm for integer programming, ” ORSA Journal on Computing, vol.5, pp.206–212, 1993.

    Google Scholar 

  6. ILOG Inc., Using the CPLEX Callable Library, 1997. Version 5.0.

  7. H.J. Lenstra, “Integer programming with a fixed number of variables, ” Mathematics of Operations Research, vol. 8, pp. 538–548, 1983.

    Google Scholar 

  8. L. Lovász and H.E. Scarf, “The generalized basis reduction algorithm, ” Mathematics of Operations Research, vol. 17, pp. 751–764, 1992.

    Google Scholar 

  9. L.A. Wolsey, Integer Programming, John Wiley, 1998.

Download references

Authors
  1. Jonathan H. Owen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Mehrotra
    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

Owen, J.H., Mehrotra, S. Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs. Computational Optimization and Applications 20, 159–170 (2001). https://doi.org/10.1023/A:1011207119557

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011207119557

Search

Navigation