An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem

Reference
management

Direct link

Bookmarks

Remove from
bookmarks

Share this by email

Share this on Twitter

Share this on Facebook

Share this on Whatsapp

Bookmarks

Media type: E-Article
Title: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
Contributor: Grippo, Luigi; Palagi, Laura; Piccialli, Veronica
Published: Springer Science and Business Media LLC, 2011
Published in: Mathematical Programming, 126 (2011) 1, Seite 119-146
Language: English
DOI: 10.1007/s10107-009-0275-8
ISSN: 0025-5610; 1436-4646
Origination:
Footnote:

... to article via Springer (in the SLUB Dresden and for members of the TU Dresden regardless of location)

... to article via EBSCOhost/ASP (in the SLUB Dresden and for members of the TU Dresden regardless of location)

... to article via EBSCOhost/BSC (in the SLUB Dresden and for members of the TU Dresden regardless of location)