Tibor Csendes – författare
1 080 kr
Skickas inom 10-15 vardagar
1 416 kr
Läs direkt efter köp
In one sense, the problem of finding the densest packing of congruent circles in a square is easy to understand. But on closer inspection, this problem reveals itself to be an interesting challenge of discrete and computational geometry with all its surprising structural forms and regularities. This book summarizes results achieved in solving the circle packing problem over the past few years, providing the reader with a comprehensive view of both theoretical and computational achievements. Typically illustrations of problem solutions are shown, elegantly displaying the results obtained.
Beyond the theoretically challenging character of the problem, the solution methods developed in the book also have many practical applications.
Since the codes can be worked with directly, they will enable the reader to improve on them and solve problem instances that still remain challenging, or to use them as a starting point for solving related application problems.
1 616 kr
Skickas inom 10-15 vardagar
1 080 kr
Skickas inom 10-15 vardagar
Developments in Global Optimization
1 616 kr
Skickas inom 10-15 vardagar
2 049 kr
Läs direkt efter köp
New Approaches to Circle Packing in a Square
With Program Codes
1 080 kr
Skickas inom 10-15 vardagar
543 kr
Skickas inom 10-15 vardagar
712 kr
Läs direkt efter köp
This book explores the updated version of the GLOBAL algorithm which contains improvements for a local search algorithm and new Java implementations. Efficiency comparisons to earlier versions and on the increased speed achieved by the parallelization, are detailed. Examples are provided for students as well as researchers and practitioners in optimization, operations research, and mathematics to compose their own scripts with ease. A GLOBAL manual is presented in the appendix to assist new users with modules and test functions. GLOBAL is a successful stochastic multistart global optimization algorithm that has passed several computational tests, and is efficient and reliable for small to medium dimensional global optimization problems. The algorithm uses clustering to ensure efficiency and is modular in regard to the two local search methods it starts with, but it can also easily apply other local techniques. The strength of this algorithm lies in its reliability and adaptive algorithm parameters. The GLOBAL algorithm is free to download also in the earlier Fortran, C, and MATLAB implementations.
1 080 kr
Skickas inom 10-15 vardagar
1 367 kr
Läs direkt efter köp