Fuzzy Greedy Search in Combinatorial Optimisation
Title | Fuzzy Greedy Search in Combinatorial Optimisation PDF eBook |
Author | Kaveh Sheibani |
Publisher | Tadbir Institute for Operational Research, Systems Design, and Financial Services |
Pages | 118 |
Release | 2008-01-01 |
Genre | Mathematics |
ISBN | 9640411183 |
In recent years, there has been a growth of interest in the development of systematic search methods for solving problems in operational research and artificial intelligence. This monograph introduces a new idea for the integration of approaches for hard combinatorial optimisation problems. The proposed methodology evaluates objects in a way that combines fuzzy reasoning with a greedy mechanism. In other words, a fuzzy solution space is exploited using greedy methods. This seems to be superior to the standard greedy version. The monograph consists of two main parts. The first part focuses on description of the theory and mathematics of the so-called fuzzy greedy evaluation concept. The second part demonstrates through computational experiments, the effectiveness and efficiency of the proposed concept within search, optimisation and learning systems for hard combinatorial optimisation problems.
Optimization by GRASP
Title | Optimization by GRASP PDF eBook |
Author | Mauricio G.C. Resende |
Publisher | Springer |
Pages | 323 |
Release | 2016-10-26 |
Genre | Mathematics |
ISBN | 1493965301 |
This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimization. For the practitioner who needs to solve combinatorial optimization problems, the book provides a chapter with four case studies and implementable templates for all algorithms covered in the text. This book, with its excellent overview of GRASP, will appeal to researchers and practitioners of combinatorial optimization who have a need to find optimal or near optimal solutions to hard combinatorial optimization problems.
Combinatorial Optimization
Title | Combinatorial Optimization PDF eBook |
Author | Bernhard Korte |
Publisher | Springer Science & Business Media |
Pages | 596 |
Release | 2006-01-27 |
Genre | Mathematics |
ISBN | 3540292977 |
This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.
Introduction to Combinatorial Optimization
Title | Introduction to Combinatorial Optimization PDF eBook |
Author | Ding-Zhu Du |
Publisher | Springer Nature |
Pages | 407 |
Release | 2022-09-26 |
Genre | Mathematics |
ISBN | 3031105966 |
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.
Local Search in Combinatorial Optimization
Title | Local Search in Combinatorial Optimization PDF eBook |
Author | Emile Aarts |
Publisher | Princeton University Press |
Pages | 525 |
Release | 2018-06-05 |
Genre | Mathematics |
ISBN | 0691187568 |
In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.
Combinatorial Optimization
Title | Combinatorial Optimization PDF eBook |
Author | William J. Cook |
Publisher | John Wiley & Sons |
Pages | 370 |
Release | 2011-09-30 |
Genre | Mathematics |
ISBN | 1118031393 |
A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade. Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include: * Network flow problems * Optimal matching * Integrality of polyhedra * Matroids * NP-completeness Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.
An Introduction to Robust Combinatorial Optimization
Title | An Introduction to Robust Combinatorial Optimization PDF eBook |
Author | Marc Goerigk |
Publisher | Springer Nature |
Pages | 316 |
Release | |
Genre | |
ISBN | 3031612612 |