Nonlinear programming without a penalty function or a filter.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 155, doi. 10.1007/s10107-008-0244-7
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2010 AND VI 122 AND IP 1
Results: 6
1
2
Conic mixed-integer rounding cuts.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 1, doi. 10.1007/s10107-008-0239-4
- By:
- Publication type:
- Article
3
On a special class of regularized central paths for semidefinite programs.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 65, doi. 10.1007/s10107-008-0241-x
- By:
- Publication type:
- Article
4
Semidefinite representation of convex sets.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 21, doi. 10.1007/s10107-008-0240-y
- By:
- Publication type:
- Article
5
Coefficient strengthening: a tool for reformulating mixed-integer programs.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 121, doi. 10.1007/s10107-008-0243-8
- By:
- Publication type:
- Article
6
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 87, doi. 10.1007/s10107-008-0242-9
- By:
- Publication type:
- Article