Global optimization

References

• Anjos , M. F. and Yen , G. 2009 . Provably near-optimal solutions for very large single-row facility layout problems . Optim. Methods Softw. , 24 : 805 – 817 .
   Web of Science ®Google Scholar
• Bao , X. , Sahinidis , N. V. and Tawarmalani , M. 2009 . Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs . Optim. Methods Softw. , 24 : 485 – 504 .
   Web of Science ®Google Scholar
• Beale , E. M.L. and Tomlin , J. A. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables . Proceedings of the Fifth International Conference on Operational Research . Edited by: Lawrence , J. pp. 447 – 454 . London : Tavistock Publications .
   Google Scholar
• Belotti , P. , Lee , J. , Liberti , L. , Margot , F. and Wächter , A. 2009 . Branching and bounds tightening techniques for non-convex MINLP . Optim. Methods Softw. , 24 : 597 – 684 .
   Web of Science ®Google Scholar
• Burer , S. and Chen , J. 2009 . A p-cone sequential relaxation procedure for 0-1 integer programs . Optim. Methods Softw. , 24 : 523 – 548 .
   Web of Science ®Google Scholar
• Cassioli , A. , Locatelli , M. and Schoen , F. 2009 . Global optimization of binary Lennard–Jones clusters . Optim. Methods Softw. , 24 : 819 – 835 .
   Web of Science ®Google Scholar
• Henrion , D. , Lasserre , J.-B. and Löfberg , J. 2009 . GloptiPoly 3: moments, optimization and semidefinite programming . Optim. Methods Softw. , 24 : 761 – 779 .
   Web of Science ®Google Scholar
• Domes , F. 2009 . GloptLab: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems . Optim. Methods Softw. , 24 : 727 – 747 .
   Web of Science ®Google Scholar
• Falk , J. E. and Soland , R. M. 1969 . An algorithm for separable nonconvex programming problems . Manage. Sci. , 15 : 550 – 569 .
   Web of Science ®Google Scholar
• Henderson , D. and Smith , J.C. 2009 . An exact reformulation-linearization technique algorithm for solving a parameter extraction problem arising in compact thermal models . Optim. Methods Softw. , 24 : 857 – 870 .
   Web of Science ®Google Scholar
• Horst , R. and Tuy , H. 1996 . Global Optimization: Deterministic Approaches , Berlin : Springer Verlag .
   Google Scholar
• Júdice , J.J. , Sherali , H.D. , Ribeiro , I.M. and Rosa , S.S. 2009 . On the asymmetric eigenvalue complementarity problem . Optim. Methods Softw. , 24 : 549 – 568 .
   Web of Science ®Google Scholar
• Kearfott , R. B. 2009 . GlobSol user guide . Optim. Methods Softw. , 24 : 687 – 708 .
   Web of Science ®Google Scholar
• Lebbah , Y. 2009 . ICOS: a branch and bound based solver for rigorous global optimization . Optim. Methods Softw. , 24 : 709 – 726 .
   Web of Science ®Google Scholar
• Lin , Y. and Schrage , L. 2009 . The global solver in the LINDO API . Optim. Methods Softw. , 24 : 657 – 668 .
   Web of Science ®Google Scholar
• Lovàsz , L. and Schrijver , A. 1991 . Cones of matrices and set-functions and 0-1 optimization . SIAM J. Optim. , 1 : 166 – 190 .
   Web of Science ®Google Scholar
• Lundell , A. and Westerlund , T. 2009 . Convex underestimation strategies for signomial functions . Optim. Methods Softw. , 24 : 505 – 522 .
   Web of Science ®Google Scholar
• McAllister , S. R. and Floudas , C. A. 2009 . Enhanced bounding techniques to reduce the protein conformational search space . Optim. Methods Softw. , 24 : 837 – 855 .
   PubMed Web of Science ®Google Scholar
• Natali , J. M. and Pinto , J. M. 2009 . Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming . Optim. Methods Softw. , 24 : 783 – 804 .
   Web of Science ®Google Scholar
• Pál , L. and Csendes , T. 2009 . INTLAB implementation of an interval global optimization algorithm . Optim. Methods Softw. , 24 : 749 – 759 .
   Web of Science ®Google Scholar
• Sahinidis , N. V. 1996 . BARON: A general purpose global optimization software package . J. Global Optim. , 8 : 201 – 205 .
   Web of Science ®Google Scholar
• Sherali , H. D. and Tuncbilek , C. H. 1992 . A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique . J. Global Optim. , 2 : 101 – 112 .
   Google Scholar
• Tuy , H. 1964 . Concave programming under linear constraints . Dokl. Akad. Nauk , 159 : 32 – 35 .
   Google Scholar
• Ugray , Z. , Lasdon , L. , Plummer , J.C. and Bussieck , Michael . 2009 . Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP . Optim. Methods Softw. , 24 : 635 – 656 .
   Web of Science ®Google Scholar
• Vaz , A. I.F. and Vicente , L. N. 2009 . PSwarm: a hybrid solver for linearly constrained global derivative-free optimization . Optim. Methods Softw. , 24 : 669 – 685 .
   Web of Science ®Google Scholar
• Wang , W. , Ghate , A. and Zabinsky , Z. 2009 . Adaptive parameterized improving hit-and-run for global optimization . Optim. Methods Softw. , 24 : 569 – 594 .
   Web of Science ®Google Scholar