The algebraic degree of semidefinite programming.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 379, doi. 10.1007/s10107-008-0253-6
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2010 AND VI 122 AND IP 2
Results: 7
1
2
An inexact Newton method for nonconvex equality constrained optimization.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 273, doi. 10.1007/s10107-008-0248-3
- By:
- Publication type:
- Article
3
Computing deep facet-defining disjunctive cuts for mixed-integer programming.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 197, doi. 10.1007/s10107-008-0245-6
- By:
- Publication type:
- Article
4
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 225, doi. 10.1007/s10107-008-0246-5
- By:
- Publication type:
- Article
5
Relative Pareto minimizers for multiobjective problems: existence and optimality conditions.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 301, doi. 10.1007/s10107-008-0249-2
- By:
- Publication type:
- Article
6
A generalization of column generation to accelerate convergence.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 349, doi. 10.1007/s10107-008-0251-8
- By:
- Publication type:
- Article
7
An integer programming approach for linear programs with probabilistic constraints.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 247, doi. 10.1007/s10107-008-0247-4
- By:
- Publication type:
- Article