Performance of approximate algorithms for global minimization
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 231-236
- https://doi.org/10.1007/bfb0121019
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible DomainMathematics of Operations Research, 1983
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex MethodMathematics of Operations Research, 1982
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976