Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear

The Nile on
Exact and Heuristic Methods in Combinatorial Optimization by Gerhard Reinelt, Rafael Martí

In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems.

FORMAT
Hardcover LANGUAGE
English CONDITION
Brand New Publisher Description

In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems. This monograph sets out state-of-the-art methodologies for solving combinatorial optimization problems, illustrating them with two well-known second edition of the book extends the first one by adding to the 'linear ordering problem' (LOP), included in the first edition, the 'maximum diversity problem' (MDP). In this way, we provide the reader with the background, elements and strategies to tackle a wide range of different combinatorial optimization problems. The exact and heuristic techniques outlined in these pages can be put to use in any number of combinatorial optimization problems. While the authors employ the LOP and the MDP to illustrate cutting-edge optimization technologies, the book is also a tutorial on how to design effective and successful implementations of exact and heuristic procedures alike. This monograph provides the basic principles and fundamental ideas that will enable students and practitioners to create valuable applications based on both exact and heuristic technologies. Specifically, it is aimed at engineers, scientists, operations researchers, and other applications specialists who are looking for the most appropriate and recent optimization tools to solve particular problems. The book provides a broad spectrum of advances in search strategies with a focus on its algorithmic and computational aspects.

Back Cover

In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems. This monograph sets out state-of-the-art methodologies for solving combinatorial optimization problems, illustrating them with two well-known problems. This second edition of the book extends the first one by adding to the 'linear ordering problem' (LOP), included in the first edition, the 'maximum diversity problem' (MDP). In this way, we provide the reader with the background, elements and strategies to tackle a wide range of different combinatorial optimization problems. The exact and heuristic techniques outlined in these pages can be put to use in any number of combinatorial optimization problems. While the authors employ the LOP and the MDP to illustrate cutting-edge optimization technologies, the book is also a tutorial on how to design effective and successful implementations of exact and heuristic procedures alike. This monograph provides the basic principles and fundamental ideas that will enable students and practitioners to create valuable applications based on both exact and heuristic technologies. Specifically, it is aimed at engineers, scientists, operations researchers, and other applications specialists who are looking for the most appropriate and recent optimization tools to solve particular problems. The book provides a broad spectrum of advances in search strategies with a focus on its algorithmic and computational aspects.

Table of Contents

1 Introduction.- 2 Heuristic Methods.- 3 Meta-Heuristics.- 4 Branch-and-Bound.- 5 Branch-and-Cut.- 6 The Linear Ordering Polytope.- 7 Further Aspects.- References.- Index.

Review

"The book is well suited for readers who want to learn how to solve real world combinatorial optimization problems as the methods are well explained and a lot of algorithms are given with pseudo-code. The authors explain all terms they use and the book is well understandable. … All in all this book can be recommended to anyone interested in combinatorial optimization who wants to get an overview of the classical solution approaches in this field." (Isabel Beckenbach, zbMATH 1500.90001, 2023)

Long Description

Complex optimization problems abound in the real world. In the face of these challenges, established methods often fall short of providing solutions. However, 'exact' and 'heuristic' techniques are dramatically enhancing our ability to solve significant practical problems in the world of optimization. They are changing the landscape in the field, broadening the frontiers of the possible, and allowing us to engage effectively with a whole new range of challenges. This monograph sets out state-of-the-art optimization methods for tackling the 'linear ordering problem' (LOP). Whereas important applications in business, engineering and economics lie beyond the reach of methodologies that have been the focus of academic research for three decades, the fresh approaches set out in this volume provide practical solutions to the focus on the LOP does not limit the monograph's scope and applicability, however. The exact and heuristic techniques outlined in these pages can be put to use in any number of combinatorial optimization problems. While the authors employ the LOP to illustrate cutting-edge optimization technologies, the book is also a tutorial on how to design effective and successful implementations of exact and heuristic procedures alike. The information in these pages provides readers with a toolkit that can be employed in a variety of settings. As a result, the book will be of great interest to researchers and practitioners in a number of fields, including computer science, mathematics, operations research, management science, industrial engineering, and economics. It is also suitable for use as a textbook on issues of practical optimization in a masters course, or as a reference book for engineering optimization algorithms. The authors have sought to make the book accessible to as wide an audience as possible by providing the reader with basic definitions and concepts in optimization. In addition, the numerous tutorials aid speedy assimilation, while the coverage given to the next generation of Flash software prepares readers for future developments.

Feature

Self-contained monograph on algorithmic issues related to the linear ordering problem Accessible without deep mathematical background Comprehensive general introduction

Details ISBN3662648768 Author Rafael Martí Short Title Exact and Heuristic Methods in Combinatorial Optimization Series Applied Mathematical Sciences Language English Year 2022 Edition 2nd ISBN-10 3662648768 ISBN-13 9783662648766 Format Hardcover Subtitle A Study on the Linear Ordering and the Maximum Diversity Problem Series Number 175 Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Pages 227 Publication Date 2022-03-10 UK Release Date 2022-03-10 DEWEY 519.62 Audience Professional & Vocational Edition Description Second Edition 2022 Replaces 9783642167287 Country of Origin NL Product Class Description Mathematics Alternative 9783662648773 Illustrations 19 Illustrations, color; 24 Illustrations, black and white
We\'ve got this

At The Nile, if you\'re looking for it, we\'ve got it.
With fast shipping, low prices, friendly service and well over a million items - you\'re bound to find what you want, at a price you\'ll love!

TheNile_Item_ID:134860074;