Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications
2011幓11ę Ā· Nonconvex Optimization and Its Applications 63 å·» Ā· Springer Science & Business Media
é»åęøē±
142
ćć¼ćø
reportč©ä¾”ćØć¬ćć„ć¼ćÆē¢ŗčŖęøćæć§ćÆććć¾ćć č©³ē“°
ćć®é»åęøē±ć«ć¤ćć¦
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.
ćć®é»åęøē±ćč©ä¾”ćć
ćęę³ććčćććć ććć
čŖęøę å ±
ć¹ćć¼ććć©ć³ćØćæćć¬ćć
Android ć iPad / iPhone ēØć® Google Play ćććÆć¹ ć¢ććŖćć¤ć³ć¹ćć¼ć«ćć¦ćć ććććć®ć¢ććŖćć¢ć«ć¦ć³ććØčŖåēć«åęćććććć©ćć§ććŖć³ć©ć¤ć³ććŖćć©ć¤ć³ć§čŖćććØćć§ćć¾ćć
ćć¼ććć½ć³ć³ćØćć¹ćÆććć ćć½ć³ć³
Google Play ć§č³¼å
„ćććŖć¼ćć£ćććÆćÆććć½ć³ć³ć®ć¦ć§ććć©ć¦ć¶ć§åēć§ćć¾ćć
é»åęøē±ćŖć¼ćć¼ćŖć©ć®ććć¤ć¹
Kobo é»åęøē±ćŖć¼ćć¼ćŖć©ć® E Ink ććć¤ć¹ć§čŖćć«ćÆććć”ć¤ć«ććć¦ć³ćć¼ććć¦ććć¤ć¹ć«č»¢éććåæ
č¦ćććć¾ćććµćć¼ćććć¦ććé»åęøē±ćŖć¼ćć¼ć«ćć”ć¤ć«ćč»¢éććę¹ę³ć«ć¤ćć¦č©³ćććÆććć«ćć»ć³ćæć¼ćć覧ćć ććć
