Global minimization of large-scale constrained concave quadratic problems by separable programming
- 1 March 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 34 (2), 163-174
- https://doi.org/10.1007/bf01580581
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Global Minimization of a Difference of Two Convex FunctionsPublished by Springer Nature ,1984
- Performance of approximate algorithms for global minimizationPublished by Springer Nature ,1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment ProblemJournal of the Operational Research Society, 1982
- A survey of methodology for the global minimization of concave functions subject to convex constraintsOmega, 1981
- Characterization of linear complementarity problems as linear programsPublished by Springer Nature ,1978
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Matrix Eigensystem Routines — EISPACK GuideLecture Notes in Computer Science, 1976
- A bilinear programming formulation of the 3-dimensional assignment problemMathematical Programming, 1974