Výsledky vyhledávání - "Unconstrained binary quadratic programming"

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances Autor Grippo, Luigi, Palagi, Laura, Piacentini, Mauro, Piccialli, Veronica, Rinaldi, Giovanni

“… (or, equivalently, of Max-Cut problems) that can be formulated as the non-convex nonlinear programming problem of minimizing a quadratic function subject to separable quadratic equality constraints…”
Získat plný text