Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Cutting Plane Algorithms for Semidefinite Relaxations

Please always quote using this URN: urn:nbn:de:0297-zib-2719
  • We investigate the potential and limits of interior point based cutting plane algorithms for semidefinite relaxations on basis of implementations for max-cut and quadratic 0-1 knapsack problems. Since the latter has not been described before we present the algorithm in detail and include numerical results.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Christoph Helmberg, Robert Weismantel
Document Type:ZIB-Report
Date of first Publication:1997/01/24
Series (Serial Number):ZIB-Report (SC-97-02)
Published in:Appeared in: P.M.Pardalos and H. Wolkowicz, Hsg., Fields Institute Communications, Band 18, AMS, 1998, 197-213
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.