Journals in DBLP

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

1. Yoshiko Ikebe, Akihisa Tamura
   Ideal polytopes and face structures of some combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:1-15 [Journal]
   
2. Sehun Kim, Kun-Nyeong Chang, Jun-Yeon Lee
   A descent method with linear programming subproblems for nondifferentiable convex optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:17-28 [Journal]
   
3. Monique Laurent, Svatopluk Poljak
   One-third-integrality in the max-cut problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:29-50 [Journal]
   
4. Chunhui Chen, Olvi L. Mangasarian
   Smoothing methods for convex inequalities and linear complementarity problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:51-69 [Journal]
   
5. Jack Brimberg
   The Fermat-Weber location problem revisited. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:71-76 [Journal]
   
6. Alfred Auslender, Mounir Haddou
   An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:77-100 [Journal]
   
7. Emilio Carrizosa, Frank Plastria
   On minquantile and maxcovering optimisation. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:101-112 [Journal]
   
8. El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey
   Optimizing constrained subtrees of trees. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:113-126 [Journal]
   
9. Charles Blair
   A closed-form representation of mixed-integer program value functions. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1995, v:71, n:, pp:127-136 [Journal]
   
10. Stefan E. Karisch, Franz Rendl
    Lower bounds for the quadratic assignment problem via triangle decompositions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:137-151 [Journal]
    
11. Andrew V. Goldberg, Robert Kennedy
    An efficient cost scaling algorithm for the assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:153-177 [Journal]
    
12. James V. Burke, Michael C. Ferris
    A Gauss-Newton method for convex composite optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:179-194 [Journal]
    
13. R. Sridhar
    Superfluous matrices in linear complementarity. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:195-206 [Journal]
    
14. Ulf Brännlund
    A generalized subgradient method with relaxation step. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:207-219 [Journal]
    
15. Erling D. Andersen, Knud D. Andersen
    Presolving in linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:221-245 [Journal]
    
16. Michele Conforti, Gérard Cornuéjols
    Balanced 0, +-1-matrixces, bicoloring and total dual integrality. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:249-258 [Journal]
    
17. Sharon Filipowski
    On the complexity of solving feasible systems of linear inequalities specified with approximate data. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:259-288 [Journal]
    
18. Bart De Schutter, Bart De Moor
    The extended linear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:289-325 [Journal]
    
19. Thomas L. Magnanti, Georgia Perakis
    A unifying geometric solution framework and complexity analysis for variational inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:327-351 [Journal]
    
20. F. Bruce Shepherd
    Applying Lehman's theorems to packing problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:353-367 [Journal]
    
21. Geoffrey Pritchard, Gül Gürkan, A. Yonca Özge
    A note on locally Lipschitzian functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:369-370 [Journal]