Safe and tight linear estimators for global optimization.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 495, doi. 10.1007/s10107-004-0533-8
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2005 AND VI 102 AND IP 3
Results: 9
1
2
A note on treating a second order cone program as a special case of a semidefinite program.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 609, doi. 10.1007/s10107-004-0546-3
- By:
- Publication type:
- Article
3
Non-euclidean restricted memory level method for large-scale convex optimization.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 407, doi. 10.1007/s10107-004-0553-4
- By:
- Publication type:
- Article
4
The two-dimensional cutting stock problem revisited.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 519, doi. 10.1007/s10107-004-0548-1
- By:
- Publication type:
- Article
5
An improved semidefinite programming relaxation for the satisfiability problem.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 589, doi. 10.1007/s10107-003-0495-2
- By:
- Publication type:
- Article
6
A polyhedral study of nonconvex quadratic programs with box constraints.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 531, doi. 10.1007/s10107-004-0549-0
- By:
- Publication type:
- Article
7
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 559, doi. 10.1007/s10107-004-0550-7
- By:
- Publication type:
- Article
8
Strengthening the Lovászbound for graph coloring.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 577, doi. 10.1007/s101070100246
- By:
- Publication type:
- Article
9
Split closure and intersection cuts.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 3, p. 457, doi. 10.1007/s10107-004-0558-z
- By:
- Publication type:
- Article