On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
暂无分享,去创建一个
[1] R. Horst,et al. On an outer approximation concept in global optimization , 1989 .
[2] Karla L. Hoffman,et al. A method for globally minimizing concave functions over convex sets , 1981, Math. Program..
[3] T. H. Matheiss,et al. A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..
[4] James E. Falk,et al. A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..
[5] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .