A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 25 (1) , 101-118
- https://doi.org/10.1007/bf02283689
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear ProgrammingINFORMS Journal on Computing, 1989
- A parallel algorithm for constrained concave quadratic global minimizationMathematical Programming, 1988
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective ValueSIAM Journal on Applied Mathematics, 1978
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex ConstraintsManagement Science, 1971
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969