Works matching IS 00255610 AND DT 1999 AND VI 86 AND IP 1
Results: 12
A polynomial cycle canceling algorithm for submodular flows.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 1, doi. 10.1007/s101070050076
- By:
- Publication type:
- Article
A branch-and-cut algorithm for capacitated network design problems.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 17
- By:
- Publication type:
- Article
Linear convergence of epsilon-subgradient descent methods for a class of convex functions.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 41, doi. 10.1007/s101070050078
- By:
- Publication type:
- Article
Upper bounds for Gaussian stochastic programs.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 51, doi. 10.1007/s101070050079
- By:
- Publication type:
- Article
Smooth methods of multipliers for complementarity problems.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 65, doi. 10.1007/s101079900076
- By:
- Publication type:
- Article
A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 91, doi. 10.1007/s101070050081
- By:
- Publication type:
- Article
Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 105, doi. 10.1007/s101070050082
- By:
- Publication type:
- Article
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 135, doi. 10.1007/s101070050083
- By:
- Publication type:
- Article
Lifting valid inequalities for the precedence constrained knapsack problem.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 161, doi. 10.1007/s101070050084
- By:
- Publication type:
- Article
A note on quadratic forms.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 187, doi. 10.1007/s101070050085
- By:
- Publication type:
- Article
Inexact implicit methods for monotone general variational inequalities.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 199, doi. 10.1007/s101070050086
- By:
- Publication type:
- Article
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard.
- Published in:
- Mathematical Programming, 1999, v. 86, n. 1, p. 219
- By:
- Publication type:
- Article