Works matching IS 00255610 AND DT 2011 AND VI 130 AND IP 1
Results: 9
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 1, doi. 10.1007/s10107-009-0299-0
- By:
- Publication type:
- Article
Processing second-order stochastic dominance models using cutting-plane representations.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 33, doi. 10.1007/s10107-009-0326-1
- By:
- Publication type:
- Article
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 59, doi. 10.1007/s10107-009-0327-0
- By:
- Publication type:
- Article
Approximation algorithms for supply chain planning and logistics problems with market choice.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 85, doi. 10.1007/s10107-009-0310-9
- By:
- Publication type:
- Article
A note on the split rank of intersection cuts.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 107, doi. 10.1007/s10107-009-0329-y
- By:
- Publication type:
- Article
Moment inequalities for sums of random matrices and their applications in optimization.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 125, doi. 10.1007/s10107-009-0330-5
- By:
- Publication type:
- Article
Lexicography and degeneracy: can a pure cutting plane algorithm work?
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 153, doi. 10.1007/s10107-009-0335-0
- By:
- Publication type:
- Article
Primal and dual linear decision rules in stochastic and robust optimization.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 177, doi. 10.1007/s10107-009-0331-4
- By:
- Publication type:
- Article
On the natural merit function for solving complementarity problems.
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 211, doi. 10.1007/s10107-009-0336-z
- By:
- Publication type:
- Article