Variable Neighbourhood Search for the Global Optimization of Constrained NLPs
暂无分享,去创建一个
[1] Pierre Hansen,et al. Variable Neighbourhood Search , 2003 .
[2] Leo Liberti,et al. The Kissing Number Problem: A New Result from Global Optimization , 2004, Electron. Notes Discret. Math..
[3] Leo Liberti,et al. Reformulation and convex relaxation techniques for global optimization , 2004, 4OR.
[4] Leo Liberti,et al. Writing Global Optimization Software , 2006 .
[5] Carlile Lavor,et al. On generating Instances for the Molecular Distance Geometry Problem , 2006 .
[6] Edward M. B. Smith,et al. On the optimal design of continuous processes , 1996 .
[7] Leo Liberti. Linearity Embedded in Nonconvex Programs , 2005, J. Glob. Optim..
[8] C. A. Haverly. Studies of the behavior of recursion for the pooling problem , 1978, SMAP.
[9] Marco Locatelli,et al. A Note on the Griewank Test Function , 2003, J. Glob. Optim..
[10] J. J. Moré,et al. Global continuation for distance geometry problems , 1995 .
[11] Mirjana Cangalovic,et al. Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search , 2003, Eur. J. Oper. Res..
[12] Nenad Mladenović,et al. A Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem , 1995 .
[13] Aharon Ben-Tal,et al. Global minimization by reducing the duality gap , 1994, Math. Program..
[14] L. Foulds,et al. A bilinear approach to the pooling problem , 1992 .
[15] N. T. Hoai-Phuong,et al. Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set , 2006 .
[16] N. Sahinidis,et al. A Lagrangian Approach to the Pooling Problem , 1999 .