Objective-derivative-free methods for constrained optimization.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 37, doi. 10.1007/s101070100266
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2002 AND VI 92 AND IP 1
Results: 8
1
2
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 61, doi. 10.1007/s101070100272
- By:
- Publication type:
- Article
3
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 1, doi. 10.1007/s101070100271
- By:
- Publication type:
- Article
4
A new inexact alternating directions method for monotone variational inequalities.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 103, doi. 10.1007/s101070100280
- By:
- Publication type:
- Article
5
A faster capacity scaling algorithm for minimum cost submodular flow.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 119, doi. 10.1007/s101070100253
- By:
- Publication type:
- Article
6
On generalized trade-off directions in nonconvex multiobjective optimization.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 141, doi. 10.1007/s101070100282
- By:
- Publication type:
- Article
7
Antiweb-wheel inequalities and their separation problems over the stable set polytopes.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 153, doi. 10.1007/s101070100267
- By:
- Publication type:
- Article
8
Convex composite non–Lipschitz programming.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 1, p. 177, doi. 10.1007/s101070100274
- By:
- Publication type:
- Article