Volume 51, 1991

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

last updated on Thu May 23 04:32:36 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page