| Publication | Date of Publication | Type |
|---|
| A Warehouse-Location Problem | 2019-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096019 | 2011-11-05 | Paper |
| A note on almost regular matrices | 1995-10-09 | Paper |
| Minimizing a unimodal function of two integer variables | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691440 | 1985-01-01 | Paper |
| Checking the Calculation of Gradients | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199833 | 1978-01-01 | Paper |
| Finding the nearest point in A polytope | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146571 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127646 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101351 | 1975-01-01 | Paper |
| Validation of subgradient optimization | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132018 | 1974-01-01 | Paper |
| Note on a method of conjugate subgradients for minimizing nondifferentiable functions | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103324 | 1974-01-01 | Paper |
| Optimal iterative processes for root-finding | 1973-01-01 | Paper |
| Linear Convergence of the Conjugate Gradient Method | 1972-01-01 | Paper |
| A new algorithm for optimization | 1972-01-01 | Paper |
| On the Convergence of Gradient Methods under Constraint | 1972-01-01 | Paper |
| Explicit solution of an optimization problem | 1972-01-01 | Paper |
| Convergence Conditions for Ascent Methods. II: Some Corrections | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103334 | 1970-01-01 | Paper |
| Convergence Conditions for Ascent Methods | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5578705 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541756 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5564917 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540114 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5560629 | 1965-01-01 | Paper |
| The Composite Simplex Algorithm | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5629405 | 1963-01-01 | Paper |
| A Technique for Resolving Degeneracy in Linear Programming | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632367 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5329507 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5730595 | 1963-01-01 | Paper |
| Linear Programming in a Markov Chain | 1962-01-01 | Paper |
| New Methods in Mathematical Programming—Some Simplex-Like Nonlinear Programming Procedures | 1962-01-01 | Paper |
| Recent Developments in Nonlinear Programming | 1962-01-01 | Paper |
| The Decomposition Algorithm for Linear Programs | 1961-01-01 | Paper |
| A duality theorem for non-linear programming | 1961-01-01 | Paper |
| Accelerating the Cutting Plane Method for Nonlinear Programming | 1961-01-01 | Paper |
| Decomposition Principle for Linear Programs | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3292035 | 1960-01-01 | Paper |
| The Simplex Method for Quadratic Programming | 1959-01-01 | Paper |
| The Secant method for simultaneous nonlinear equations | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3245648 | 1957-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3236247 | 1956-01-01 | Paper |
| The generalized simplex method for minimizing a linear form under linear inequality restraints | 1955-01-01 | Paper |
| The strict determinateness of certain infinite games | 1955-01-01 | Paper |
