On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 533, doi. 10.1007/s10107-002-0363-5
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2003 AND VI 95 AND IP 3
Results: 9
1
2
Primal separation for 0/1 polytopes.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 475, doi. 10.1007/s10107-002-0309-y
- By:
- Publication type:
- Article
3
Scenario reduction in stochastic programming.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 493
- By:
- Publication type:
- Article
4
A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 513, doi. 10.1007/s10107-002-0312-3
- By:
- Publication type:
- Article
5
Non-Interior continuation methods for solving semidefinite complementarity problems.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 431, doi. 10.1007/s10107-002-0306-1
- By:
- Publication type:
- Article
6
Accumulating Jacobians as chained sparse matrix products.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 555, doi. 10.1007/s10107-002-0329-7
- By:
- Publication type:
- Article
7
An augmented Lagrangian interior-point method using directions of negative curvature.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 573, doi. 10.1007/s10107-002-0360-8
- By:
- Publication type:
- Article
8
Computing optimal preemptive schedules for parallel tasks: linear programming approaches.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 617, doi. 10.1007/s10107-002-0361-7
- By:
- Publication type:
- Article
9
Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods.
- Published in:
- Mathematical Programming, 2003, v. 95, n. 3, p. 631, doi. 10.1007/s10107-002-0346-6
- By:
- Publication type:
- Article