Journals in DBLP

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

1. James Renegar, Michael Shub
   Unified complexity analysis for Newton LP methods. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:1-16 [Journal]
   
2. Thomas F. Coleman, Peter A. Fenyes
   Partitioned quasi-Newton methods for nonlinear equality constrained optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:17-44 [Journal]
   
3. D. Burton, Philippe L. Toint
   On an instance of the inverse shortest paths problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:45-61 [Journal]
   
4. Franz Rendl, Henry Wolkowicz
   Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:63-78 [Journal]
   
5. H. Edwin Romeijn, Robert L. Smith, James C. Bean
   Duality in infinite dimensional linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:79-97 [Journal]
   
6. Masao Fukushima
   Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:99-110 [Journal]
   
7. V. Hien Nguyen, Jean-Jacques Strodiot
   Computing a global optimal solution to a design centering problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:111-123 [Journal]
   
8. J. Michael Steele
   Euclidean semi-matchings of random samples. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:127-146 [Journal]
   
9. Jean Fonlupt, Denis Naddef
   The traveling salesman problem in graphs with some excluded minors. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:53, n:, pp:147-172 [Journal]
   
10. Matteo Fischetti, Paolo Toth
    An additive bounding procedure for the asymmetric travelling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:173-197 [Journal]
    
11. Jos A. M. Potters, Imma J. Curiel, Stef Tijs
    Traveling salesman games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:199-211 [Journal]
    
12. Robert Fourer
    A simplex algorithm for piecewise-linear programming III: Computational analysis and applications. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:213-235 [Journal]
    
13. S. R. Mohan, R. Sridhar
    A note on a characterization of P-matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:237-242 [Journal]
    
14. Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
    Finding minimum-cost flows by double scaling. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:243-266 [Journal]
    
15. C. Zalinescu
    A note on d-stability of convex programs and limiting Lagrangians. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:267-277 [Journal]
    
16. Berç Rustem
    A constrained min-max algorithm for rival models of the same economic system. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:279-295 [Journal]
    
17. Paul Tseng
    Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:297-306 [Journal]
    
18. B. Curtis Eaves, Uriel G. Rothblum
    Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:307-321 [Journal]
    
19. Zelda B. Zabinsky, Robert L. Smith
    Pure adaptive search in global optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:323-338 [Journal]
    
20. Phan Thien Thach
    A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:339-359 [Journal]
    
21. Takeshi Naitoh, Satoru Fujishige
    A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:361-363 [Journal]