Journals in DBLP

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

1. Robert G. Bland, David L. Jensen
   On the computational behavior of a polynomial-time network flow algorithm. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:1-39 [Journal]
   
2. James B. Orlin, Ravindra K. Ahuja
   New scaling algorithms for the assignment and minimum mean cycle problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:41-56 [Journal]
   
3. Uriel G. Rothblum
   Characterization of stable matchings as extreme points of a polytope. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:57-67 [Journal]
   
4. E. R. Barnes, Alan J. Hoffman, Uriel G. Rothblum
   Optimal partitions having disjoint convex and conic hulls. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:69-86 [Journal]
   
5. H. C. Lai, S. Y. Wu
   Extremal points and optimal solutions for general capacity problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:87-113 [Journal]
   
6. Alain Billionnet, Alain Sutter
   Persistency in quadratic 0-1 optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:115-119 [Journal]
   
7. Stephen A. Vavasis
   Local minima for indefinite quadratic knapsack problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:127-153 [Journal]
   
8. E. Polak, J. E. Higgins, D. Q. Mayne
   A barrier function method for minimax problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:155-176 [Journal]
   
9. Roman A. Polyak
   Modified barrier functions (theory and methods). [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:54, n:, pp:177-222 [Journal]
   
10. Regina Hunter Mladineo
    Convergence rates of a global optimization algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:223-232 [Journal]
    
11. Richard J. Caron, M. Hlynka, J. F. McDonald
    On the best case performance of hit and run methods for detecting necessary constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:233-249 [Journal]
    
12. Kurt M. Anstreicher, Robert A. Bosch
    Long steps in an O(n³L) algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:251-265 [Journal]
    
13. Masakazu Kojima, Nimrod Megiddo, Yinyu Ye
    An interior point potential reduction algorithm for the linear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:267-279 [Journal]
    
14. Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford
    Crashing a maximum-weight complementary basis. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:281-294 [Journal]
    
15. Kees Roos, Jean-Philippe Vial
    A polynomial method of approximate centers for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:295-305 [Journal]
    
16. Irwin E. Schochetman, Robert L. Smith
    Finite dimensional approximation in infinite dimensional mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:307-333 [Journal]
    
17. Donald M. Topkis
    Paths on polymatroids. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:335-351 [Journal]
    
18. Jorge P. Sousa, Laurence A. Wolsey
    A time indexed formulation of non-preemptive single machine scheduling problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:353-367 [Journal]