Combinatorial interior point methods for generalized network flow problems.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 227, doi. 10.1007/s10107-002-0333-y
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2002 AND VI 93 AND IP 2
Results: 9
1
2
Convex extensions and envelopes of lower semi-continuous functions.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 247, doi. 10.1007/s10107-002-0308-z
- By:
- Publication type:
- Article
3
A note on sensitivity of value functions of mathematical programs with complementarity constraints.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 265, doi. 10.1007/s10107-002-0301-6
- By:
- Publication type:
- Article
4
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 195, doi. 10.1007/s10107-002-0337-7
- By:
- Publication type:
- Article
5
On some interior-point algorithms for nonconvex quadratic optimization.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 217, doi. 10.1007/s10107-002-0310-5
- By:
- Publication type:
- Article
6
A spectral bundle method with bounds.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 173, doi. 10.1007/s101070100270
- By:
- Publication type:
- Article
7
Generalized Goal Programming: polynomial methods and applications.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 281, doi. 10.1007/s10107-002-0303-4
- By:
- Publication type:
- Article
8
An analytic center quadratic cut method for the convex quadratic feasibility problem.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 305, doi. 10.1007/s10107-002-0330-1
- By:
- Publication type:
- Article
9
On the convergence of the Weiszfeld algorithm.
- Published in:
- Mathematical Programming, 2002, v. 93, n. 2, p. 327
- By:
- Publication type:
- Article