Skip to main content
SpringerLink
Log in

Quadratic knapsack relaxations using cutting planes and semidefinite programming

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1084))

Abstract

We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Balas, S. Ceria and G. Cornuejols. A lift-and-project cutting plane algorithm for mixed 0/1 programs, Mathematical Programming 58:295–324, 1993.

    Article  Google Scholar 

  2. C. De Simone. The cut polytope and the boolean quadric polytope. Discrete Mathematics, 79:71–75, 1989.

    Article  Google Scholar 

  3. C. E. Ferreira, A. Martin, C. De Souza, R. Weismantel and L. Wolsey. Formulations and valid inequalities for the node capacitated graph partitioning problem, CORE discussion paper No. 9437, Université Catholique de Louvain, 1994. To appear in Mathematical Programming.

    Google Scholar 

  4. C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz. Combining Semidefinite and Polyhedral Relaxations for Integer Programs. Lecture Notes in Computer Science, 920:124–134, 1995, Proceedings of IPCO 4 (E. Balas, J. Clausen eds).

    Google Scholar 

  5. C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM Journal on Optimization. To appear.

    Google Scholar 

  6. E. Johnson, A. Mehrotra and G.L. Nemhauser. Min-cut clustering, Mathematical Programming 62:133–152, 1993.

    Article  Google Scholar 

  7. L. Lovász and A. Schrijver. Cones of matrices and set functions and 0–1 optimization. SIAM J. Optimization, 1(2):166–190, 1991.

    Article  Google Scholar 

  8. S. Näher and C. Uhrig. The LEDA User Manual Version R 3.3 beta. MaxPlanck-Institut für Informatik, Im Stadtwald, Building 46.1, D-66123 Saarbrücken, Germany, (http://www.mpi-sb.mpg.de/LEDA/leda.html)

    Google Scholar 

  9. M. W. Padberg. The boolean quadric polytope, Mathematical Programming 45:132–172, 1989.

    Article  Google Scholar 

  10. R. Weismantel. On the 0/1 knapsack polytope, Preprint SC 94-01, Konrad-Zuse-Zentrum Berlin, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Konrad Zuse Zentrum für Informationstechnik Berlin, Heilbronnerstraße 10, D-10711, Berlin, Germany

    C. Helmberg & R. Weismantel

  2. Technische Universität Graz, Institut für Mathematik, Steyrergasse 30, A-8010, Graz, Austria

    F. Rendl

Authors
  1. C. Helmberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Rendl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Weismantel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William H. Cunningham S. Thomas McCormick Maurice Queyranne

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Helmberg, C., Rendl, F., Weismantel, R. (1996). Quadratic knapsack relaxations using cutting planes and semidefinite programming. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-61310-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61310-7

  • Online ISBN: 978-3-540-68453-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation