Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Cover and Pack Inequalities for (Mixed) Integer Programming

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

Abstract

We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer knapsack set, and the mixed integer knapsack set. Our aim is to give a unified presentation of the inequalities based on covers and packs and highlight the connections among them. The focus of the paper is on recent research on the use of superadditive functions for the analysis of knapsack polyhedra.

We also present some new results on integer knapsacks. In particular, we give an integer version of the cover inequalities and describe a necessary and sufficient facet condition for them. This condition generalizes the well-known facet condition of minimality of covers for 0-1 knapsacks.

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

  • Aardal, K., R. Weismantel, and L.A. Wolsey. (2002). “Non-Standard Approaches to Integer Programming.” Discrete Applied Mathematics 123, 5–74.

    Article  Google Scholar 

  • Aráoz, J., L. Evans, E.L. Johnson, and R.E. Gomory. (2003). “Cyclic Group and Knapsack Facets.” Mathematical Programming 2, 312–339.

    Google Scholar 

  • Atamtürk, A. (2001). “Flow Pack Facets of the Single Node Fixed-Charge Flow Polytope.” Operations Research Letters 29, 107–114.

    Article  Google Scholar 

  • Atamtürk, A. (2002). “On Capacitated Network Design Cut-Set Polyhedra.” Mathematical Programming 92, 425–437.

    Article  Google Scholar 

  • Atamtürk, A. (2003). “On the Facets of the Mixed-Integer Knapsack Polyhedron.” Mathematical Programming 98, 145–175.

    Article  Google Scholar 

  • Atamtürk, A. (2004). “Sequence Independent Lifting for Mixed-Integer Programming.” Operations Research, 52, 487–490.

    Article  Google Scholar 

  • Atamtürk, A. and D. Rajan. (2002). “On Splittable and Unsplittable Flow Capacitated Network Design Arc-Set Polyhedra.” Mathematical Programming 92, 315–333.

    Article  Google Scholar 

  • Atamtürk, A. and D. Rajan. (2004). “Valid Inequalities for Mixed-Integer Knapsack from Two-Integer Variable Restrictions.” Research Report BCOL.04.02, University of California at Berkeley. Available at http://ieor.berkeley.edu/~atamturk.

  • Balas, E. (1975). “Facets of the Knapsack Polytope.” Mathematical Programming 8, 146–164.

    Article  Google Scholar 

  • Balas, E. and E. Zemel. (1978). “Facets of the Knapsack Polytope from Minimal Covers.” SIAM Journal of Applied Mathematics 34, 119–148.

    Article  Google Scholar 

  • Balas, E. and E. Zemel. (1984). Lifting and Complementing Yields All Facets of Positive Zero–One Programming Polytopes. In R.W.C. et al. (eds.), Proceedings of the International Conference on Mathematical Programming, pp. 13–24.

  • Brockmüller, B., O. Günlük, and L.A. Wolsey. (1996). “Designing Private Line Networks—Polyhedral Analysis and Computation.” CORE Discussion Paper 9647, Université Catholique de Louvain.

  • Ceria, S., C. Cordier, H. Marchand, and L.A. Wolsey. (1998). “Cutting Planes for Integer Programs with General Integer Variables.” Mathematical Programming 81, 201–214.

    Google Scholar 

  • Crowder, H., E.L. Johnson, and M.W. Padberg. (1983). “Solving Large-Scale Zero-One Linear Programming Problems.” Operations Research 31, 803–834.

    Google Scholar 

  • Dash, S. and O. Günlük. (2004). “Valid Inequalities Based on Simple Mixed-Integer Sets.” In Proceedings of the 10th International Integer Programming and Combinatorial Optimization Conference, pp. 33–45.

  • Escudero, L.E., A. Garín, and G. Péres. (2003). “An O(n log n) Procedure for Identifying Facets of the Knapsack Polytope.” Operations Research Letters 31, 211–218.

    Article  Google Scholar 

  • Gomory, R.E. (1969). “Some Polyhedra Related to Combinatorial Problems.” Linear Algebra and Its Applications 2, 451–558.

    Article  Google Scholar 

  • Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1998). “Cover Inequalities for 0-1 Integer Programs: Computation.” INFORMS Journal on Computing 10, 427–437.

    Google Scholar 

  • Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999a). “Cover Inequalities for 0-1 Integer Programs: Complexity.” INFORMS Journal on Computing 11, 117–123.

    Google Scholar 

  • Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999b). “Lifted Flow Cover Inequalities for Mixed 0-1 Integer Programs.” Mathematical Programming 85, 439–467.

    Article  Google Scholar 

  • Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). “Sequence Independent Lifting in Mixed Integer Programming.” Journal of Combinatorial Optimization, 4:109–129.

    Article  Google Scholar 

  • Hammer, P.L., E.L. Johnson, and U.N. Peled. (1975). “Facets of Regular 0-1 Polytopes.” Mathematical Programming 8, 179–206.

    Article  Google Scholar 

  • Johnson, E.L. and M.W. Padberg. (1981). “A Note on Knapsack Problem with Special Ordered Sets.” Operations Research Letters 1, 18–22.

    Article  Google Scholar 

  • Klabjan, D. and G.L. Nemhauser. (2002). “A Polyhedral Study of Integer Variable Upper Bounds.” Mathematics of Operations Research 27, 711–739.

    Article  Google Scholar 

  • Louveaux, Q. and L.A. Wolsey. (2003). “Lifting, Superadditivity, Mixed Integer Rounding, and Single Node Flow Sets Revisited.” CORE Discussion Paper 2003/1, Université Catholique de Louvain.

  • Magnanti, T.L. and P. Mirchandani. (1993). “Shortest Paths, Single Origin-Destination Network Design, and Associated Polyhedra.” Networks 23, 103–121.

    Google Scholar 

  • Magnanti, T.L., P. Mirchandani, and R. Vachani. (1993). “The Convex Hull of Two Core Capacitated Network Design Problems.” Mathematical Programming 60, 233–250.

    Article  Google Scholar 

  • Marchand, H. and L.A. Wolsey. (1999). “The 0-1 Knapsack Problem with a Single Continuous Variable.” Mathematical Programming 85, 15–33.

    Article  Google Scholar 

  • Marchand, H. and L.A. Wolsey. (2001). “Aggregation and Mixed Integer Rounding to Solve MIPs.” Operations Research 49, 363–371.

    Article  Google Scholar 

  • Martin, A. and R. Weismantel. (1997). “Contribution to General Mixed Integer Knapsack Problems.” Technical Report SC 97-38, Konrad-Zuse-Zentrum für Informationstechnik Berlin.

  • Mazur, D.R. and L.A. Hall. (2002). “Facets of a Polyhedron Closely Related to the Integer Knapsack-Cover Problem.” Manuscript at http://www.optimization-online.org.

  • Nemhauser, G.L. and P. Vance. (1994). Lifted Cover Facets of the 0-1 Knapsack Polytope with GUB Constraints.” Operations Research Letters 16, 255–263.

    Article  Google Scholar 

  • Nemhauser, G.L. and L.A. Wolsey. (1990). “A Recursive Procedure for Generating All Cuts for 0-1 Mixed Integer Programs.” Mathematical Programming 46, 379–390.

    Article  Google Scholar 

  • Padberg, M.W. (1973). “On the Facial Structure of Set Packing Polyhedra.” Mathematical Programming 5, 199–215.

    Article  Google Scholar 

  • Padberg, M.W. (1979a). “Covering, Packing and Knapsack Problems.” Annals of Discrete Mathematics 4, 265–287.

    Article  Google Scholar 

  • Padberg, M.W. (1979b). “A Note On 0-1 Programming.” Operations Research 23, 833–837.

    Google Scholar 

  • Padberg, M. W. (1980). “(1,k)-Configurations and Facets for Packing Problems.” Mathematical Programming 18, 94–99.

    Article  Google Scholar 

  • Pochet, Y. and R. Weismantel. (1998). “The Sequential Knapsack Polytope.” SIAM Journal on Optimization 8, 248–264.

    Article  Google Scholar 

  • Pochet, Y. and L.A. Wolsey. (1995). “Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, Optimization, and Separation.” Discrete Applied Mathematics 59, 57–74.

    Article  Google Scholar 

  • Richard, J., I.R. de Farias, and G.L. Nemhauser. (2003). “Lifted Inequalities for 0-1 Mixed Integer Programming : Basic Theory and Algorithms.” Mathematical Programming 98, 89–113.

    Article  Google Scholar 

  • Sherali, H.D. and Y. Lee. (1995). “Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes.” SIAM Journal on Discrete Mathematics 8, 133–153.

    Article  Google Scholar 

  • van Hoesel, S.P.M., A.M.C.A. Koster, R.L.M.J. van de Leensel, and M.W.P. Savelsbergh. (2002). “Polyhedral Results for the Edge Capacity Polytope.” Mathematical Programming 92, 335–358.

    Article  Google Scholar 

  • Weismantel, R. (1996). “Hilbert Bases and the Facets of Special Knapsack Polytopes.” Mathematics of Operations Research 21, 886–904.

    Google Scholar 

  • Weismantel, R. (1997). On the 0/1 Knapsack Polytope. Mathematical Programming 77, 49–68.

    Article  Google Scholar 

  • Wolsey, L.A. (1975). “Faces for Linear Inequality in 0-1 Variables.” Mathematical Programming 8, 165–178.

    Article  Google Scholar 

  • Wolsey, L.A. (1976). Facets and Strong Valid Inequalities for Integer Programs.” Operations Research 24, 367–372.

    Google Scholar 

  • Wolsey, L.A. (1977). “Valid Inequalities and Superadditivity for 0/1 Integer Programs.” Mathematics of Operations Research 2, 66–77.

    Google Scholar 

  • Zemel, E. (1978). “Lifting the Facets of Zero-One Polytopes.” Mathematical Programming 15, 268–277.

    Article  Google Scholar 

  • Zemel, E. (1989). “Easily Computable Facets of the Knapsack Polytope.” Mathematics of Operations Research 14, 760–764.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA

    Alper Atamtürk

Authors
  1. Alper Atamtürk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alper Atamtürk.

Additional information

The author is supported, in part, by NSF Grants 0070127 and 0218265.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Atamtürk, A. Cover and Pack Inequalities for (Mixed) Integer Programming. Ann Oper Res 139, 21–38 (2005). https://doi.org/10.1007/s10479-005-3442-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-3442-1

Keywords

Search

Navigation