Journals in DBLP

Math. Program.
1995, volume: 68, number:

1. Peter Kleinschmidt, Heinz Schannath
   A strongly polynomial algorithm for the transportation problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:1-13 [Journal]
   
2. J. F. Bonnans, Jean Charles Gilbert, Claude Lemaréchal, Claudia A. Sagastizábal
   A family of variable metric proximal methods. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:15-47 [Journal]
   
3. Gongyun Zhao
   On the choice of parameters for power-series interior point algorithms in linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:49-71 [Journal]
   
4. Alberto Marchetti-Spaccamela, Carlo Vercellis
   Stochastic on-line knapsack problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:73-104 [Journal]
   
5. Jirí Outrata, Jochem Zowe
   A numerical approach to optimization problems with variational inequality constraints. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:105-130 [Journal]
   
6. Sung-Pil Hong, Sushil Verma
   A note on the strong polynomiality of convex quadratic programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:131-139 [Journal]
   
7. Richard A. Tapia, Yin Zhang, Yinyu Ye
   On the convergence of the iteration sequence in primal-dual interior-point methods. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:141-154 [Journal]
   
8. E. Andrew Boyd
   Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:155-168 [Journal]
   
9. Wieslawa T. Obuchowska, Richard J. Caron
   Minimal representation of quadratically constrained convex feasible regions. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:68, n:, pp:169-186 [Journal]
   
10. G. S. R. Murthy, T. Parthasarathy, G. Ravindran
    On co-positive, semi-monotone Q-matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:187-203 [Journal]
    
11. Pascual Ruíz-Canales, Antonio Rufián-Lizana
    A characterization of weakly efficient points. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:205-212 [Journal]
    
12. Daniel Bienstock, Oktay Günlük
    Computational experience with a difficult mixed-integer multicommodity flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:213-237 [Journal]
    
13. Egon Balas, Matteo Fischetti, William R. Pulleyblank
    The precedence-constrained asymmetric traveling salesman polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:241-265 [Journal]
    
14. José Mario Martínez, Sandra Augusta Santos
    A trust-region strategy for minimization on arbitrary domains. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:267-301 [Journal]
    
15. Yin Zhang, Detong Zhang
    On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:303-318 [Journal]
    
16. John E. Dennis Jr., Shou-Bai B. Li, Richard A. Tapia
    A unified approach to global convergence of trust region methods for nonsmooth optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:319-346 [Journal]