000			03150nam a22004935i 4500
001			978-1-4614-1951-8
003			DE-He213
005			20140220083244.0
007			cr nn 008mamaa
008			111104s2012 xxu| s |||| 0|eng d
020			_a9781461419518 _9978-1-4614-1951-8
024	7		_a10.1007/978-1-4614-1951-8 _2doi
050		4	_aQA402.5-402.6
072		7	_aPBU _2bicssc
072		7	_aMAT003000 _2bisacsh
082	0	4	_a519.6 _223
100	1		_aScholz, Daniel. _eauthor.
245	1	0	_aDeterministic Global Optimization _h[electronic resource] : _bGeometric Branch-and-bound Methods and their Applications / _cby Daniel Scholz.
264		1	_aNew York, NY : _bSpringer New York, _c2012.
300			_aXIV, 142 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSpringer Optimization and Its Applications, _x1931-6828 ; _v63
505	0		_aPrincipals and basic concepts.- The geometric branch-and-bound algorithm.-Bounding operations -- Extension for multicriteria problems -- Multicriteria discarding tests -- Extension for mixed combinatorial problems -- The circle detection problem -- Integrated scheduling and location problems -- The median line problem -- Summary and discussion -- References -- Index.
520			_aThis monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization problems are considered. Numerical examples based on facility location problems support the theory. Applications of geometric branch-and-bound methods, namely the circle detection problem in image processing, the integrated scheduling and location makespan problem, and the median line location problem in the three-dimensional space are also presented. The book is intended for both researchers and students in the areas of mathematics, operations research, engineering, and computer science.
650		0	_aMathematics.
650		0	_aAlgorithms.
650		0	_aComputer science.
650		0	_aMathematical optimization.
650	1	4	_aMathematics.
650	2	4	_aOptimization.
650	2	4	_aOperations Research, Management Science.
650	2	4	_aComputational Science and Engineering.
650	2	4	_aAlgorithms.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461419501
830		0	_aSpringer Optimization and Its Applications, _x1931-6828 ; _v63
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-1951-8
912			_aZDB-2-SMA
999			_c101167 _d101167