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

Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cuttings Planes

Please always quote using this URN: urn:nbn:de:0297-zib-2012
  • We present computational experiments for solving quadratic $(0,1)$ problems. Our approach combines a semidefinite relaxation with a cutting plane technique, and is applied in a Branch and Bound setting. Our experiments indicate that this type of approach is very robust, and allows to solve many moderately sized problems, having say, less than 100 binary variables, in a routine manner.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Christoph Helmberg, Franz Rendl
Document Type:ZIB-Report
Date of first Publication:1995/11/30
Series (Serial Number):ZIB-Report (SC-95-35)
Published in:Appeared in: Mathematical Programming, 82 (1998) pp. 291-315
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.