Improved strategies for branching on general disjunctions.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 225, doi. 10.1007/s10107-009-0333-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2011 AND VI 130 AND IP 2
Results: 6
1
2
Branching in branch-and-price: a generic scheme.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 249, doi. 10.1007/s10107-009-0334-1
- By:
- Publication type:
- Article
3
(Robust) Edge-based semidefinite programming relaxation of sensor network localization.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 321, doi. 10.1007/s10107-009-0338-x
- By:
- Publication type:
- Article
4
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 295, doi. 10.1007/s10107-009-0337-y
- By:
- Publication type:
- Article
5
Quadratic regularizations in an interior-point method for primal block-angular problems.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 415, doi. 10.1007/s10107-010-0341-2
- By:
- Publication type:
- Article
6
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 2, p. 359, doi. 10.1007/s10107-010-0340-3
- By:
- Publication type:
- Article