Abschätzungen bei Variationsmethoden mit Hilfe von Dualitätssätzen. I.
Active set and interior methods for nonlinear optimization.
Algorithm 25. Discrete optimization by the method of Mao and Wallingford
Algorithm 30. The calculation of the minimum of a certain function of one variable
Algorithm 31. The calculation of the minimum of a certain function of several variables
Algorithm. 44. MIMUN. Optimization of one-dimensional multimodal functions in the presence of noise
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithm 5. Solution of the transportation problem by bridges dual labeling method
Algorithme d'approximation interne de problèmes de point de selle avec contraintes via l'optimisation
Algorithms 77-78. Uniform approximation of empirical functions being either monotone or having a fixed number of extrema
Algorithms for Bound Constrained Quadratic Programming Problems.
Algorithms for Optimal Design with Application to Multiple Polynomial Regression.
Alguns teoremas sobre a equivalência do problema do caixeiro viajante múltiplo ao problema do caixeiro viajante
Amélioration de la stabilité numérique d'algorithmes de résolution de programmes linéaires à matrices de contraintes clairsemées
An adaptive parallel projection method for solving convex feasibility problems.
An Algorithm for Calculating One Subgradient of a Convex Function of Two Variables.
An Algorithm for Determining Redundant Inequalities and All Solutions to Convex Polyhedra.
An Algorithm for Discrete Linear Lp Approximation.
An Alternative Computational Method for the Approximation of Random Functions.