Copyright © Mon Nov 2 21:48:20 2009
by Michael Ley (firstname.lastname@example.org)
- B. Curtis Eaves, Alan J. Hoffman, Hui Hu:
Linear programming with spheres and hemispheres of objective vectors.
- Donald Goldfarb, Dong Xiao:
A primal projective interior point method for linear programming.
- Konstantinos Paparrizos:
An infeasible (exterior point) simplex algorithm for assignment problems.
- J. Randall Brown:
Solving knapsack sharing problems with general tradeoff functions.
- Hiroshi Yabe, Toshihiko Takahashi:
Factorized quasi-Newton methods for nonlinear least squares problems.
- Jong-Shi Pang:
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems.
- Michael Werman, David Magagnosc:
The relationship between integer and real solutions of constrained convex programming.
- Martin Grötschel, Olaf Holland:
Solution of large-scale symmetric travelling salesman problems.
- Robert M. Freund:
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function.
- Eugene K. Yang, Jon W. Tolle:
A class of methods for solving large, convex quadratic programs subject to box constraints.
- Hoang Tuy:
Normal conical algorithm for concave minimization over polytopes.
- Faiz A. Al-Khayyal:
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q0.
- Ludwig J. Cromme, Immo Diener:
Fixed point theorems for discontinuous mapping.
- Leszek S. Zaremba:
Perfect graphs and norms.
- Andreas Griewank, Hubertus Th. Jongen, Man Kam Kwong:
The equivalence of strict convexity and injectivity of the gradient in bounded level sets.
- C. T. Kelley, Stephen J. Wright:
Sequential quadratic programming for certain parameter identification problems.
- P. Alart, B. Lemaire:
Penalization in non-classical convex programming via variational convergence.
- Bernd Luderer:
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem.
- Sara van de Geer, Leen Stougie:
On rates of convergence and asymptotic normality in the multiknapsack problem.
- Denis Naddef, Giovanni Rinaldi:
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.
- Matteo Fischetti:
Facts of two Steiner arborescence polyhedra.