handbook global optimization (69 resultados)

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condición: Gut. Auflage: 1995. 898 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 1494 25,4 x 17,8 x 5,7 cm, Gebundene Ausgabe.

XIII, 880 S. OPpbd., Bibl.-Expl. mit den üblichen Kennzeichnungen, Klebespur am Einband.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - What is combinatorial optimization Traditionally, a problem is considered to be c- binatorial if its set of feasible solutions is both nite and discrete, i. e. , enumerable. For example, the traveling salesman problem asks in what order a salesman should visit the cities in his territory if he wants to minimize his total mileage (see Sect. 2. 2. 2). The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a nite, discrete set. By contrast, Differential Evolution was originally designed to optimize functions de ned on real spaces. Unlike combinatorial problems, the set of feasible solutions for real parameter optimization is continuous. Although Differential Evolution operates internally with oating-point precision, it has been applied with success to many numerical optimization problems that have t- ditionally been classi ed as combinatorial because their feasible sets are discrete. For example, the knapsack problem's goal is to pack objects of differing weight and value so that the knapsack's total weight is less than a given maximum and the value of the items inside is maximized (see Sect. 2. 2. 1). The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete. To handle such problems while retaining full precision, Differential Evolution copies oating-point - lutions to a temporary vector that, prior to being evaluated, is truncated to the nearest feasible solution, e. g. , by rounding the temporary parameters to the nearest nonnegative integer.

Hardcover. Condición: Très bon. Ancien livre de bibliothèque. Edition 1999. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1999. Ammareal gives back up to 15% of this item's net price to charity organizations.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Significant research activities have taken place in the areas of local and global optimization in the last two decades. Many new theoretical, computational, algorithmic, and software contributions have resulted. It has been realized that despite these numerous contributions, there does not exist a systematic forum for thorough experimental computational testing and evaluation of the proposed optimization algorithms and their implementations. Well-designed nonconvex optimization test problems are of major impor tance for academic and industrial researchers interested in algorithmic and software development. It is remarkable that eventhough nonconvex models dominate all the important application areas in engineering and applied sci ences, there is only a limited dass of reported representative test problems. This book reflects our long term efforts in designing a benchmark database and it is motivated primarily from the need for nonconvex optimization test problems. The present collection of benchmarks indudes test problems from literature studies and a large dass of applications that arise in several branches of engineering and applied science.

Condición: New. In.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 stochastic and deterministic approaches to continuous and mixed-integer global optimization, such as stochastic 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.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Global optimization is concerned with the computation and characterization of global optima of nonlinear functions. During the past three decades the field of global optimization has been growing at a rapid pace, and the number of publications on all aspects of global optimization has been increasing steadily. Many applications, as well as new theoretical, algorithmic, and computational contributions have resulted. The Handbook of Global Optimization is the first comprehensive book to cover recent developments in global optimization. Each contribution in the Handbook is essentially expository in nature, but scholarly in its treatment. The chapters cover optimality conditions, complexity results, concave minimization, DC programming, general quadratic programming, nonlinear complementarity, minimax problems, multiplicative programming, Lipschitz optimization, fractional programming, network problems, trajectory methods, homotopy methods, interval methods, and stochastic approaches. The Handbook of Global Optimization is addressed to researchers in mathematical programming, as well as all scientists who use optimization methods to model and solve problems.

Hardcover. Condición: New. ISBN:9783540921509.