Author:
Hamed Ammar Salah El -Deen,McCormick Garth Philip
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference45 articles.
1. Avriel, M. (1973), Methods for Solving Signomial and Reverse Convex Programming Problems, in Avrielet al. (eds.),Optimization and Design, Prentice Hall Inc., Englewood Cliffs, NJ 307?320.
2. Benson, H. P. (1975), A Finite Algorithm for Concave Minimzation over a Polyhedron,Naval Research Logistics Quarterly 32, 165?177.
3. Benson, H. P. (1982), On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems,Journal of Optimization Theory and Applications,36, 129?134.
4. Falk, J. E. and R. M. Soland (1969), An Algorithm for Separable Nonconvex Programming Problems,Management Science 15, 550?569.
5. Fiacco, A. V. and G. P. McCormick (1990),Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, New York (1968); reprinted asClassics in Applied Mathematics Vol. 4, SIAM, Philadelphia, PA.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献