Journals in DBLP

Math. Program.
2003, volume: 95, number: 3

1. Xin Chen, Paul Tseng
   Non-Interior continuation methods for solving semidefinite complementarity problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:431-474 [Journal]
   
2. Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
   Primal separation for 0/1 polytopes. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:475-491 [Journal]
   
3. Jitka Dupacová, Nicole Gröwe-Kuska, Werner Römisch
   Scenario reduction in stochastic programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:493-511 [Journal]
   
4. T. E. S. Raghavan, Zamir Syed
   A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:513-532 [Journal]
   
5. Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
   On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:533-554 [Journal]
   
6. Andreas Griewank, Uwe Naumann
   Accumulating Jacobians as chained sparse matrix products. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:555-571 [Journal]
   
7. Javier M. Moguerza, Francisco J. Prieto
   An augmented Lagrangian interior-point method using directions of negative curvature. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:573-616 [Journal]
   
8. Klaus Jansen, Lorant Porkolab
   Computing optimal preemptive schedules for parallel tasks: linear programming approaches. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:617-630 [Journal]
   
9. A. F. Izmailov, Mikhail V. Solodov
   Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:631-650 [Journal]