Skip to main content
SpringerLink
Log in

Cutting planes for mixed-integer knapsack polyhedra

  • Published:
Mathematical Programming Submit manuscript

Abstract

An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact separation procedure and is based on a general methodology proposed by one of the authors in an earlier paper. Computational results are presented. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

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. H. Crowder, E.L. Johnson, M.W. Padberg, Solving large scale zero–one linear programming problems, Operations Research 31 (1983) 803–834.

    Google Scholar 

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

    Google Scholar 

  3. E.L. Johnson, M.M. Kostreva, U.H. Suhl, Solving 0–1 integer programming problems arising from large scale planning models, Operations Research 33 (1985) 803–819.

    Google Scholar 

  4. E.L. Johnson, M.W. Padberg, A note on the knapsack problem with special ordered sets, Operations Research Letters 1 (1981) 18–22.

    Google Scholar 

  5. W.P. Savelsbergh, G.C. Sigismondi, 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).

  6. E.A. Boyd, Fenchel cutting planes for integer programs, Operations Research 42 (1994) 53–64.

    Google Scholar 

  7. E.A. Boyd, Generating Fenchel cutting planes for knapsack polyhedra, SIAM Journal on Optimization 3 (1993) 734–750.

    Google Scholar 

  8. E.A. Boyd, 1995. On the convergence of Fenchel cutting planes in mixed-integer programming, SIAM Journal on Optimization 5.

  9. E.A. Boyd, Optimization Cutting Planes for Integer Programs, Springer, New York (forthcoming book).

  10. X. Yan, E.A. Boyd, Cutting planes for mixed-integer knapsack polyhedra, working paper, Department of Industrial Engineering, Texas A&M University (1996).

Download references

Author information

Authors and Affiliations

  1. Texas A&M University, Texas, USA

    Xiao-Qing Yan & E. Andrew Boyd

Authors
  1. Xiao-Qing Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Andrew Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Andrew Boyd.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, XQ., Boyd, E.A. Cutting planes for mixed-integer knapsack polyhedra. Mathematical Programming 81, 257–262 (1998). https://doi.org/10.1007/BF01581108

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation