Cutting Plane Algorithms for Semidefinite Relaxations
Zitieren Sie bitte immer diese 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.
Verfasserangaben: | Christoph Helmberg, Robert Weismantel |
---|---|
Dokumentart: | ZIB-Report |
Datum der Erstveröffentlichung: | 24.01.1997 |
Schriftenreihe (Bandnummer): | ZIB-Report (SC-97-02) |
ZIB-Reportnummer: | SC-97-02 |
Verlagspublikation: | Appeared in: P.M.Pardalos and H. Wolkowicz, Hsg., Fields Institute Communications, Band 18, AMS, 1998, 197-213 |