Journals in DBLP

Math. Program.
1992, volume: 56, number:

1. S. Frank Chang, S. Thomas McCormick
   A hierarchical algorithm for making sparse matrices sparser. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:1-30 [Journal]
   
2. Shinji Mizuno
   A new polynomial time method for a linear complementarity problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:31-43 [Journal]
   
3. Douglas J. White
   A linear programming approach to solving bilinear programmes. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:45-50 [Journal]
   
4. Hiroshi Konno, Takahito Kuno
   Linear multiplicative programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:51-64 [Journal]
   
5. Jerzy Kyparisis, Chi-Ming Ip
   Solution behavior for parametric implicit complementarity problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:65-70 [Journal]
   
6. Chi-Ming Ip, Jerzy Kyparisis
   Local convergence of quasi-Newton methods for B-differentiable equations. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:71-89 [Journal]
   
7. Silvia Vogel
   On stability in multiobjective programming - A stochastic approach. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:91-119 [Journal]
   
8. Michel Deza, Monique Laurent
   Facets for the cut cone I. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:121-160 [Journal]
   
9. Michel Deza, Monique Laurent
   Facets for the cut cone II: Clique-web inequalities. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:56, n:, pp:161-188 [Journal]
   
10. Thomas F. Coleman, Yuying Li
    A globally and quadratically convergent affine scaling method for linear l₁ problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:189-222 [Journal]
    
11. Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible
    Generalized convexity on affine subspaces with an application to potential functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:223-232 [Journal]
    
12. Kazunori Yokoyama
    epsilon-optimality criteria for convex programming problems via exact penalty functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:233-243 [Journal]
    
13. John E. Mitchell, Michael J. Todd
    Solving combinatorial optimization problems using Karmarkar's algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:245-284 [Journal]
    
14. Yinyu Ye
    On affine scaling algorithms for nonconvex quadratic programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:285-300 [Journal]
    
15. Paul Tseng, Zhi-Quan Luo
    On the convergence of the affine-scaling algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:301-319 [Journal]
    
16. C. Wallacher, Uwe Zimmermann
    A combinatorial interior point method for network flow problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:321-335 [Journal]
    
17. J. W. Schmidt, S. Dietze
    Unconstrained duals to partially separable constrained programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:337-341 [Journal]
    
18. János D. Pintér
    Convergence qualification of adaptive partition algorithms in global optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:343-360 [Journal]
    
19. Michael C. Ferris, Andrew B. Philpott
    On affine scaling and semi-infinite programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:361-364 [Journal]