New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 31, doi. 10.1007/s10107-007-0138-0
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2008 AND VI 115 AND IP 1
Results: 6
1
2
The capacitated max k-cut problem.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 65, doi. 10.1007/s10107-007-0139-z
- By:
- Publication type:
- Article
3
Sparse quasi-Newton updates with positive definite matrix completion.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 1, doi. 10.1007/s10107-007-0137-1
- By:
- Publication type:
- Article
4
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 105, doi. 10.1007/s10107-007-0141-5
- By:
- Publication type:
- Article
5
A simplex based algorithm to solve separated continuous linear programs.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 151, doi. 10.1007/s10107-008-0217-x
- By:
- Publication type:
- Article
6
The mixing-MIR set with divisible capacities.
- Published in:
- Mathematical Programming, 2008, v. 115, n. 1, p. 73, doi. 10.1007/s10107-007-0140-6
- By:
- Publication type:
- Article