On sensitivity of central solutions in semidefinite programming.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 205, doi. 10.1007/PL00011422
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2001 AND VI 90 AND IP 2
Results: 8
1
2
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 229
- By:
- Publication type:
- Article
3
On the complexity of a class of combinatorial optimization problems with uncertainty.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 263, doi. 10.1007/PL00011424
- By:
- Publication type:
- Article
4
Optimization via enumeration: a new algorithm for the Max Cut Problem.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 273, doi. 10.1007/PL00011425
- By:
- Publication type:
- Article
5
A cutting plane algorithm for the General Routing Problem.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 291
- By:
- Publication type:
- Article
6
Variational analysis of non-Lipschitz spectral functions.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 317, doi. 10.1007/s101070100225
- By:
- Publication type:
- Article
7
Combinatorial relaxation algorithm for mixed polynomial matrices.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 353, doi. 10.1007/PL00011427
- By:
- Publication type:
- Article
8
Concavity cuts for disjoint bilinear programming.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 2, p. 373, doi. 10.1007/PL00011428
- By:
- Publication type:
- Article