@book {695,
	title = {Foundations of Computational Intelligence Volume 3: Global Optimization},
	year = {2009},
	publisher = {Studies in Computational Intelligence, Springer Verlag, Vol. 203 },
	organization = {Studies in Computational Intelligence, Springer Verlag, Vol. 203 },
	address = {Germany},
	abstract = {<p>Global optimization is a branch of applied mathematics and numerical analysis that deals with the task of finding the absolutely best set of admissible conditions to satisfy certain criteria / objective function(s), formulated in mathematical terms. Global optimization includes nonlinear, stochastic and combinatorial programming, multiobjective programming, control, games, geometry, approximation, algorithms for parallel architectures and so on. Due to its wide usage and applications, it has gained the attention of researchers and practitioners from a plethora of scientific domains. Typical practical examples of global optimization applications include: Traveling salesman problem and electrical circuit design (minimize the path length); safety engineering (building and mechanical structures); mathematical problems (Kepler conjecture); Protein structure prediction (minimize the energy function) etc.</p>
},
	url = {http://www.springer.com/engineering/computational+intelligence+and+complexity/book/978-3-642-01084-2},
	author = {Ajith Abraham, Aboul-Ella Hassanien, Patrick Siarry, Andries Engelbrecht}
}
