ISO-690 (author-date, English)

GRIPPO, Luigi, PALAGI, Laura und PICCIALLI, Veronica, 2011. An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming. 1 Januar 2011. Vol. 126, no. 1, p. 119-146. DOI 10.1007/s10107-009-0275-8.

Elsevier - Harvard (with titles)

Grippo, L., Palagi, L., Piccialli, V., 2011. An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming 126, 119-146. https://doi.org/10.1007/s10107-009-0275-8

American Psychological Association 7th edition

Grippo, L., Palagi, L., & Piccialli, V. (2011). An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming, 126(1), 119-146. https://doi.org/10.1007/s10107-009-0275-8

Springer - Basic (author-date)

Grippo L, Palagi L, Piccialli V (2011) An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.. Mathematical Programming 126:119-146. https://doi.org/10.1007/s10107-009-0275-8

Juristische Zitierweise (Stüber) (Deutsch)

Grippo, Luigi/ Palagi, Laura/ Piccialli, Veronica, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem., Mathematical Programming 2011, 119-146.

Bitte prüfen Sie die Zitate auf Korrektheit, bevor Sie diese in Ihre Arbeit einfügen.