A lagrangean relaxation algorithm for the constrained matrix problem
- 1 February 1986
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 33 (1), 55-76
- https://doi.org/10.1002/nav.3800330106
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problemsPublished by Springer Nature ,1982
- A polynomially bounded algorithm for a singly constrained quadratic programMathematical Programming, 1980
- Minimum norm problems over transportation polytopesLinear Algebra and its Applications, 1980
- ALGORITHMS FOR OPTIMAL ALLOCATION PROBLEMS HAVING QUADRATIC OBJECTIVE FUNCTIONJournal of the Operations Research Society of Japan, 1980
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective FunctionJournal of the Operational Research Society, 1979
- Dualität und Approximation bei konvexen OptimierungsproblemenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1978
- A Simple Algorithm for Stone's Version of the Portfolio Selection ProblemJournal of Financial and Quantitative Analysis, 1975
- Monotone solutions of the parametric linear complementarity problemMathematical Programming, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970