SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 353, doi. 10.1007/s10107-012-0593-0
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2012 AND VI 136 AND IP 2
Results: 8
1
2
The quadratic Graver cone, quadratic integer minimization, and extensions.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 301, doi. 10.1007/s10107-012-0605-0
- By:
- Publication type:
- Article
3
Preface.
- Published in:
- 2012
- By:
- Publication type:
- Editorial
4
On semidefinite programming relaxations of maximum $$k$$-section.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 253, doi. 10.1007/s10107-012-0603-2
- By:
- Publication type:
- Article
5
Some results on the strength of relaxations of multilinear functions.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 325, doi. 10.1007/s10107-012-0606-z
- By:
- Publication type:
- Article
6
Solving $$k$$-cluster problems to optimality with semidefinite programming.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 279, doi. 10.1007/s10107-012-0604-1
- By:
- Publication type:
- Article
7
On convex relaxations for quadratically constrained quadratic programming.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 233, doi. 10.1007/s10107-012-0602-3
- By:
- Publication type:
- Article
8
A storm of feasibility pumps for nonconvex MINLP.
- Published in:
- Mathematical Programming, 2012, v. 136, n. 2, p. 375, doi. 10.1007/s10107-012-0608-x
- By:
- Publication type:
- Article