default search action
Mathematical Programming, Volume 51
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 Q0. 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, Bernard 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 A. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-07 23:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: