Cantitate/Preț
Produs

The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization: Applied Mathematical Sciences, cartea 175

Autor Rafael Martí, Gerhard Reinelt
en Limba Engleză Paperback – 25 feb 2013
Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.
Citește tot Restrânge

Din seria Applied Mathematical Sciences

Preț: 56642 lei

Preț vechi: 70803 lei
-20% Nou

Puncte Express: 850

Preț estimativ în valută:
10841 11299$ 9025£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642266560
ISBN-10: 3642266568
Pagini: 184
Ilustrații: XII, 172 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.27 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Applied Mathematical Sciences

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Recenzii

From the reviews:
“The authors had two main goals when writing the text. The first was simply to survey the literature on the LOP. … the second was to use the LOP as a vehicle for introducing key concepts of combinatorial optimization to the reader. … the book will be attractive only to established researchers who need or want to learn about the LOP … . The book is written in a very readable style and … the material is ordered in a logical way.” (Adam Letchford, Interfaces, Vol. 42 (3), May-June, 2012)

Textul de pe ultima copertă

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 LOP. 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 thecoverage given to the next generation of Flash software prepares readers for future developments.

Caracteristici

Self-contained monograph on algorithmic issues related to the linear ordering problem Comprehensive general introduction to algorithms for computing approximate and exact solutions of combinatorial optimization problems Accessible without deep mathematical background Includes supplementary material: sn.pub/extras