Deterministic Global Optimization Geometric Branch-and-bound Methods and their Applications /

This 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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Scholz, Daniel (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: New York, NY : Springer New York, 2012.
Σειρά:Springer Optimization and Its Applications, 63
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03244nam a22005175i 4500
001 978-1-4614-1951-8
003 DE-He213
005 20151125222014.0
007 cr nn 008mamaa
008 111104s2012 xxu| s |||| 0|eng d
020 |a 9781461419518  |9 978-1-4614-1951-8 
024 7 |a 10.1007/978-1-4614-1951-8  |2 doi 
040 |d GrThAP 
050 4 |a QA402.5-402.6 
072 7 |a PBU  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
082 0 4 |a 519.6  |2 23 
100 1 |a Scholz, Daniel.  |e author. 
245 1 0 |a Deterministic Global Optimization  |h [electronic resource] :  |b Geometric Branch-and-bound Methods and their Applications /  |c by Daniel Scholz. 
264 1 |a New York, NY :  |b Springer New York,  |c 2012. 
300 |a XIV, 142 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer Optimization and Its Applications,  |x 1931-6828 ;  |v 63 
505 0 |a Principals 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 |a This 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 |a Mathematics. 
650 0 |a Algorithms. 
650 0 |a Computer mathematics. 
650 0 |a Mathematical optimization. 
650 0 |a Operations research. 
650 0 |a Management science. 
650 1 4 |a Mathematics. 
650 2 4 |a Optimization. 
650 2 4 |a Operations Research, Management Science. 
650 2 4 |a Computational Science and Engineering. 
650 2 4 |a Algorithms. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9781461419501 
830 0 |a Springer Optimization and Its Applications,  |x 1931-6828 ;  |v 63 
856 4 0 |u http://dx.doi.org/10.1007/978-1-4614-1951-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649)