Skip to main content
SpringerLink
Log in

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4513))

Abstract

In this paper, we present a systematic method to derive strong superadditive approximations of multidimensional lifting functions using single-dimensional superadditive functions. This constructive approach is based on the observation that, in many cases, the lifting function of a multidimensional problem can be expressed or approximated through the single-dimensional lifting function of some of its components. We then apply our approach to two variants of classical models and show that it yields an efficient procedure to derive strong valid inequalities.

This research is supported by NSF Grant DMI-03-48611.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atamtürk, A.: Flow pack facets of the single node fixed-charge flow polytope. Operations Research Letters 29, 107–114 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Atamtürk, A.: On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming 98, 145–175 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Atamtürk, A.: Sequence independent lifting for mixed-integer programming. Operations Research 52, 487–490 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146–164 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boland, N., Fricke, C., Froylandz, G., Sotirov, R.: Clique-based facets for the precedence constrained knapsack polyhedron. Technical report, The University of Melbourne, Australia (2005)

    Google Scholar 

  6. Boyd, E.: Polyhedral results for the precedence-constrained knapsack problem. Discrete Applied Mathematics 41, 185–201 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Crowder, H., Johnson, E., Padberg, M.: Solving large scale zero-one linear programming problem. Operations Research 31, 803–834 (1983)

    MATH  Google Scholar 

  8. Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted cover inequalities for 0-1 integer programs: computation. INFORMS Journal on Computing 10, 427–437 (1998)

    MathSciNet  Google Scholar 

  9. Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming 85, 439–468 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gu, Z., Nemhauser, G., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109–129 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hammer, P., Johnson, E., Peled, U.: Facets of regular 0-1 polytopes. Mathematical Programming 8, 179–206 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  12. Louveaux, Q., Wolsey, L.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1, 173–207 (2003)

    MathSciNet  MATH  Google Scholar 

  13. Marchand, H., Wolsey, L.: The 0-1 knapsack problem with a single continuous variable. Mathematical Programming 85, 15–33 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)

    MATH  Google Scholar 

  15. Padberg, M.: On the facial structure of set packing polyhedra. Mathematical Programming 5, 199–215 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  16. Padberg, M., Van Roy, T., Wolsey, L.: Valid inequalities for fixed charge problems. Mathematical Programming 33, 842–861 (1985)

    MATH  Google Scholar 

  17. Park, K., Park, S.: Lifting cover inequalities for the precedence-constrained knapsack problem. Discrete Applied Mathematics 72, 219–241 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shebalov, S., Klabjan, D.: Sequence independent lifting for mixed integer programs with variable upper bounds. Mathematical Programming 105, 523–561 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. van de Leensel, R.L.M.J., van Hoesel, C.P.M., van de Klundert, J.J.: Lifting valid inequalities for the precedence constrained knapsack problem. Mathematical Programming 86, 161–185 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. Van Roy, T., Wolsey, L.: Solving mixed integer programming problems using automatic reformulation. Operations Research 35, 45–57 (1987)

    MathSciNet  MATH  Google Scholar 

  21. Van Roy, T., Wolsey, L.: Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 14, 199–213 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wolsey, L.: Faces for a linear inequality in 0-1 variables. Mathematical Programming 8, 165–178 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  23. Wolsey, L.: Facets and strong valid inequalities for integer programs. Operations Research 24, 367–372 (1976)

    MathSciNet  MATH  Google Scholar 

  24. Wolsey, L.: Valid inequalities and superadditivity for 0/1 integer programms. Mathematics of Operations Research 2, 66–77 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  25. Zeng, B., Richard, J.-P.P.: Sequentially lifted valid inequalities for 0–1 knapsack problem with disjoint cardinality constraints. Technical report, Purdue University (2006)

    Google Scholar 

  26. Zeng, B., Richard, J.-P.P.: Sequence independent lifting for 0–1 knapsack problem with disjoint cardinality constraints. Technical report, Purdue University (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial Engineering, Purdue University, 315 N. Grant Street, West Lafayette, IN 47907-2023,  

    Bo Zeng & Jean-Philippe P. Richard

Authors
  1. Bo Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Philippe P. Richard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Matteo Fischetti David P. Williamson

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Zeng, B., Richard, JP.P. (2007). A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications. In: Fischetti, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. IPCO 2007. Lecture Notes in Computer Science, vol 4513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72792-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72792-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72791-0

  • Online ISBN: 978-3-540-72792-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation