Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- 1 June 1989
- journal article
- Published by Springer Nature in Computing
- Vol. 42 (2-3) , 271-289
- https://doi.org/10.1007/bf02239754
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problemsMathematical Programming, 1988
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimizationOperations Research Letters, 1988
- Outer approximation by polyhedral convex setsOR Spectrum, 1987
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmizationOptimization, 1987
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- On the global minimization of concave functionsOR Spectrum, 1984
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976