Works matching IS 00255610 AND DT 2004 AND VI 100 AND IP 2
Results: 10
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 295, doi. 10.1007/s10107-003-0470-y
- By:
- Publication type:
- Article
A note on linear complementarity problems and multiple objective programming.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 339, doi. 10.1007/s10107-003-0473-8
- By:
- Publication type:
- Article
The integration of an interior-point cutting plane method within a branch-and-price algorithm.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 267, doi. 10.1007/s10107-003-0469-4
- By:
- Publication type:
- Article
Optimal location and design of a competitive facility.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 247, doi. 10.1007/s10107-003-0468-5
- By:
- Publication type:
- Article
A finite branch-and-bound algorithm for two-stage stochastic integer programs.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 355, doi. 10.1007/s10107-003-0475-6
- By:
- Publication type:
- Article
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 345, doi. 10.1007/s10107-003-0474-7
- By:
- Publication type:
- Article
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 317, doi. 10.1007/s10107-003-0472-9
- By:
- Publication type:
- Article
A globally convergent primal-dual interior-point filter method for nonlinear programming.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 379, doi. 10.1007/s10107-003-0477-4
- By:
- Publication type:
- Article
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 423, doi. 10.1007/s10107-003-0481-8
- By:
- Publication type:
- Article
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation.
- Published in:
- Mathematical Programming, 2004, v. 100, n. 2, p. 411, doi. 10.1007/s10107-003-0479-2
- By:
- Publication type:
- Article