Journals in DBLP

Math. Program.
1991, volume: 51, number:

1. B. Curtis Eaves, Alan J. Hoffman, Hui Hu
   Linear programming with spheres and hemispheres of objective vectors. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:1-16 [Journal]
   
2. Donald Goldfarb, Dong Xiao
   A primal projective interior point method for linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:17-43 [Journal]
   
3. Konstantinos Paparrizos
   An infeasible (exterior point) simplex algorithm for assignment problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:45-54 [Journal]
   
4. J. Randall Brown
   Solving knapsack sharing problems with general tradeoff functions. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:55-73 [Journal]
   
5. Hiroshi Yabe, Toshihiko Takahashi
   Factorized quasi-Newton methods for nonlinear least squares problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:75-100 [Journal]
   
6. Jong-Shi Pang
   A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:101-131 [Journal]
   
7. Michael Werman, David Magagnosc
   The relationship between integer and real solutions of constrained convex programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:133-135 [Journal]
   
8. Martin Grötschel, Olaf Holland
   Solution of large-scale symmetric travelling salesman problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:141-202 [Journal]
   
9. Robert M. Freund
   Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1991, v:51, n:, pp:203-222 [Journal]
   
10. Eugene K. Yang, Jon W. Tolle
    A class of methods for solving large, convex quadratic programs subject to box constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:223-228 [Journal]
    
11. Hoang Tuy
    Normal conical algorithm for concave minimization over polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:229-245 [Journal]
    
12. Faiz A. Al-Khayyal
    Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q₀. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:247-255 [Journal]
    
13. Ludwig J. Cromme, Immo Diener
    Fixed point theorems for discontinuous mapping. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:257-267 [Journal]
    
14. Leszek S. Zaremba
    Perfect graphs and norms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:269-272 [Journal]
    
15. Andreas Griewank, Hubertus Th. Jongen, Man Kam Kwong
    The equivalence of strict convexity and injectivity of the gradient in bounded level sets. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:273-278 [Journal]
    
16. C. T. Kelley, Stephen J. Wright
    Sequential quadratic programming for certain parameter identification problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:281-305 [Journal]
    
17. P. Alart, B. Lemaire
    Penalization in non-classical convex programming via variational convergence. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:307-331 [Journal]
    
18. Bernd Luderer
    Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:333-348 [Journal]
    
19. Sara van de Geer, Leen Stougie
    On rates of convergence and asymptotic normality in the multiknapsack problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:349-358 [Journal]
    
20. Denis Naddef, Giovanni Rinaldi
    The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:359-400 [Journal]
    
21. Matteo Fischetti
    Facts of two Steiner arborescence polyhedra. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:401-419 [Journal]