Journals in DBLP

Math. Program.
1997, volume: 79, number:

1. Alfred Auslender
   How to deal with the unbounded in optimization: Theory and algorithms. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:3-18 [Journal]
   
2. Egon Balas
   A modified lift-and-project procedure. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:19-31 [Journal]
   
3. Alexander I. Barvinok
   Measure concentration in optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:33-53 [Journal]
   
4. Rainer E. Burkard
   Efficiently solvable special cases of hard combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:55-69 [Journal]
   
5. Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye
   Two applications of the Divide&Conquer principle in the molecular sciences. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:71-97 [Journal]
   
6. Arne Stolbjerg Drud
   Interactions between nonlinear programming and modeling systems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:99-123 [Journal]
   
7. Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
   Algorithms for railway crew management. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:125-141 [Journal]
   
8. Michel X. Goemans
   Semidefinite programming in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:143-161 [Journal]
   
9. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
   Logical analysis of numerical data. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1997, v:79, n:, pp:163-190 [Journal]
   
10. Pierre Hansen, Brigitte Jaumard
    Cluster analysis and mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:191-215 [Journal]
    
11. Gil Kalai
    Linear programming, the simplex algorithm and simple polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:217-233 [Journal]
    
12. Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
    Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:235-253 [Journal]
    
13. Monique Laurent
    Cuts, matrix completions and graph rigidity. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:255-283 [Journal]
    
14. Yurii Nesterov
    Interior-point methods: An old and new approach to nonlinear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:285-297 [Journal]
    
15. Jong-Shi Pang
    Error bounds in mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:299-332 [Journal]
    
16. Andrzej Ruszczynski
    Decomposition methods in stochastic programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:333-353 [Journal]
    
17. Herbert E. Scarf
    Test sets for integer programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:355-368 [Journal]
    
18. Komei Fukuda, Tamás Terlaky
    Criss-cross methods: A fresh view on pivot algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:369-395 [Journal]
    
19. Andrew R. Conn, Katya Scheinberg, Philippe L. Toint
    Recent progress in unconstrained nonlinear optimization without derivatives. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:397-414 [Journal]
    
20. Michael R. Bussieck, Thomas Winter, Uwe Zimmermann
    Discrete optimization in public rail transport. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:415-444 [Journal]
    
21. Jochem Zowe, Michal Kocvara, Martin P. Bendsøe
    Free material optimization via mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:445-466 [Journal]