Skip to main content
Log in

Solving 0/1 integer programs with enumeration cutting planes

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

A cutting plane technique with applicability to the solution of integer programs is presented. The computational value of this technique is demonstrated by applying it to a collection of seven difficult integer programs arising from real-world applications. Four of the seven problems are solved to optimality without the aid of branch and bound, and six of the seven problems have the gap between the value of the integer program and its linear programming relaxation closed by over 98%.

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

Access this article

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, A lift-and-project cutting plane algorithm for mixed 0–1 programs, Management Science Research Report 576, Graduate School of Industrial Administration, Carnegie Mellon University (1991).

  2. R.E. Bixby, E.A. Boyd and R. Indovina, MIPLIB: A test set of mixed integer programming problems, SIAM News 25(March 1992)16.

    Google Scholar 

  3. E.A. Boyd, Fenchel cutting planes for integer programs, Oper. Res. (1990), to appear.

  4. E.A. Boyd, Generating Fenchel cutting planes for knapsack polyhedra, SIAM J. Opt. (1990), to appear.

  5. E.A. Boyd, On the convergence of Fenchel cutting planes in mixed-integer programming, SIAM J. Opt. (1991), to appear.

  6. H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Oper. Res. 31(1983)803–834.

    Google Scholar 

  7. R.E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bull. Amer. Math. Soc. 64(1958)275–278.

    Google Scholar 

  8. M. Grötschel, L. Lovász and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, New York, 1988).

    Google Scholar 

  9. K.L. Hoffman and M.W. Padberg, Improving the LP-representation of zero-one linear programs for branch-and-cut, ORSA J. Comp. 3(1991)121–134.

    Google Scholar 

  10. C. Lemaréchal, Nondifferentiable optimization, in:Optimization, ed. G.L. Nemhauser et al.,Handbooks in Operations Research and Management Science, vol. 1(North-Holland, New York, 1989) pp. 529–572.

    Google Scholar 

  11. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  12. W.P. Savelsbergh, G.C. Sigismondi and G.L. Nemhauser, Functional description of MINTO, A Mixed INTeger Optimizer, Technical Report COC-91-03, Computational Optimization Center, School of Industrial and Systems Engineering, Georgia Institute of Technology (1991).

  13. W.P. Savelsbergh, G.C. Sigismondi and G.L. Nemhauser, MINTO, A Mixed INTeger Optimizer, Technical Report COC-91-04, Computational Optimization Center, School of Industrial and Systems Engineering, Georgia Institute of Technology (1991).

  14. J.F. Shapiro, Generalized Lagrange multipliers in integer programming, Oper. Res. 19(1971) 68–76.

    Google Scholar 

  15. J.F. Shapiro,Mathematical Programming: Structures and Algorithms (Wiley, New York, 1979).

    Google Scholar 

  16. P. Wolfe, Finding the nearest point in a polytope, Math. Progr. 11(1976)128–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrew Boyd, E. Solving 0/1 integer programs with enumeration cutting planes. Ann Oper Res 50, 61–72 (1994). https://doi.org/10.1007/BF02085635

Download citation

  • Issue Date:

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

Keywords

Navigation