Home
Handbook of Global Optimization: Volume 2 / Edition 1
Loading Inventory...
Barnes and Noble
Handbook of Global Optimization: Volume 2 / Edition 1
Current price: $219.99


Barnes and Noble
Handbook of Global Optimization: Volume 2 / Edition 1
Current price: $219.99
Loading Inventory...
Size: OS
*Product Information may vary - to confirm product availability, pricing, and additional information please contact Barnes and Noble
In 1995 the Handbook of Global Optimization (first volume), edited by R. Horst, and P.M. Pardalos, was published. This second volume of the Handbook of Global Optimization is comprised of chapters dealing with modern approaches to global optimization, including different types of heuristics.
Topics covered in the handbook include various metaheuristics, such as simulated annealing, genetic algorithms, neural networks, taboo search, shake-and-bake methods, and deformation methods. In addition, the book contains chapters on new exact shastic and deterministic approaches to continuous and mixed-integer global optimization, such as shastic adaptive search, two-phase methods, branch-and-bound methods with new relaxation and branching strategies, algorithms based on local optimization, and dynamical search. Finally, the book contains chapters on experimental analysis of algorithms and software, test problems, and applications.
Topics covered in the handbook include various metaheuristics, such as simulated annealing, genetic algorithms, neural networks, taboo search, shake-and-bake methods, and deformation methods. In addition, the book contains chapters on new exact shastic and deterministic approaches to continuous and mixed-integer global optimization, such as shastic adaptive search, two-phase methods, branch-and-bound methods with new relaxation and branching strategies, algorithms based on local optimization, and dynamical search. Finally, the book contains chapters on experimental analysis of algorithms and software, test problems, and applications.