Solving mixed integer nonlinear programs by outer approximation
暂无分享,去创建一个
[1] G. R. Walsh,et al. Methods Of Optimization , 1976 .
[2] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[3] Raymond Breu,et al. Branch and bound experiments in zero-one programming , 1974 .
[4] Rafael Lazimy,et al. Improved algorithm for mixed-integer quadratic programs and a computational study , 1985, Math. Program..
[5] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..
[6] R. Fletcher. Practical Methods of Optimization , 1988 .
[7] X. Yuan,et al. Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés , 1988 .
[8] F. Körner. A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems , 1988 .
[9] I. Grossmann,et al. Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis , 1988 .
[10] I. Grossmann,et al. A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .
[11] Alexander H. G. Rinnooy Kan,et al. Decomposition in general mathematical programming , 1993, Math. Program..
[12] M. Tamiz,et al. Stability, Duality and Decomposition in General Mathematical Programming , 1993 .