Journals in DBLP

Math. Program.
1993, volume: 62, number:

1. Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
   Series parallel composition of greedy linear programming problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:1-14 [Journal]
   
2. Robert Fourer, Sanjay Mehrotra
   Solving symmetric indefinite systems in an interior-point method for linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:15-39 [Journal]
   
3. S. Kingsley Gnanendran, James K. Ho
   Load balancing in the parallel optimization of block-angular linear programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:41-67 [Journal]
   
4. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
   Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:69-83 [Journal]
   
5. Tohru Ishihara, Masakazu Kojima
   On the big Mu in the affine scaling algorithm. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:85-93 [Journal]
   
6. Kim L. Jones, Irvin Lustig, Judith M. Farvolden, Warren B. Powell
   Multicommodity network flows: The impact of formulation on decomposition. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:95-117 [Journal]
   
7. Shinji Mizuno, Atsushi Nagasawa
   A primal-dual affine-scaling potential-reduction algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:119-131 [Journal]
   
8. Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser
   Min-cut clustering. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:133-151 [Journal]
   
9. M. J. D. Powell
   On the number of iterations of Karmarkar's algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1993, v:62, n:, pp:153-197 [Journal]
   
10. Alan J. Hoffman, Arthur F. Veinott Jr.
    Staircase transportation problems with superadditive rewards and cumulative capacities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:199-213 [Journal]
    
11. Stein W. Wallace, Roger J.-B. Wets
    The facets of the polyhedral set determined by the Gale-Hoffman inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:215-222 [Journal]
    
12. A. A. Goldstein
    A global Newton method II: Analytic centers. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:223-237 [Journal]
    
13. Phan Thien Thach, Hiroshi Konno
    A generlized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:239-260 [Journal]
    
14. Rafael Correa, Claude Lemaréchal
    Convergence of some algorithms for convex minimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:261-275 [Journal]
    
15. Olvi L. Mangasarian, Mikhail V. Solodov
    Nonlinear complementarity as unconstrained and constrained minimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:277-297 [Journal]
    
16. Robert Mifflin, Jean-Jacques Strodiot
    A rapidly convergent five-point algorithm for univariate minimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:299-319 [Journal]
    
17. Michael L. Overton, Robert S. Womersley
    Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:321-357 [Journal]
    
18. Jong-Shi Pang
    A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:359-383 [Journal]
    
19. E. Polak
    On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:385-414 [Journal]
    
20. Stephen M. Robinson
    Nonsingularity and symmetry for linear normal maps. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:415-425 [Journal]
    
21. Dan Feng, Paul D. Frank, Robert B. Schnabel
    Local convergence analysis of tensor methods for nonlinear equations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:427-459 [Journal]
    
22. David B. Shmoys, Éva Tardos
    An approximation algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:461-474 [Journal]
    
23. Arie Tamir
    The least element property of center location on tree networks with applications to distance and precedence constrained problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:475-496 [Journal]
    
24. Sanjay Mehrotra, Yinyu Ye
    Finding an interior point in the optimal face of linear programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:497-515 [Journal]
    
25. Kurt M. Anstreicher
    Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:517-535 [Journal]
    
26. Yinyu Ye, Kurt M. Anstreicher
    On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:537-551 [Journal]
    
27. B. Curtis Eaves
    Pivoting to normalize a basic matrix. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:553-556 [Journal]
    
28. Charles Delorme, Svatopluk Poljak
    Laplacian eigenvalues and the maximum cut problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:557-574 [Journal]
    
29. Gabriele Danninger, Immanuel M. Bomze
    Using copositivity for global optimality criteria in concave quadratic programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:575-580 [Journal]