You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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 s...
This comprehensive handbook brings together experts who use optimization to solve problems that arise in telecommunications. It is the first book to cover in detail the field of optimization in telecommunications. Recent optimization developments that are frequently applied to telecommunications are covered. The spectrum of topics covered includes planning and design of telecommunication networks, routing, network protection, grooming, restoration, wireless communications, network location and assignment problems, Internet protocol, World Wide Web, and stochastic issues in telecommunications. The book’s objective is to provide a reference tool for the increasing number of scientists and engineers in telecommunications who depend upon optimization.
This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications.
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems,...
This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.
This book provides an insightful and modern treatment of combinatorial and algorithmic mathematics, with an elegant transition from mathematical foundations to optimization. It is designed for mathematics, computer science, and engineering students. The book is crowned with modern optimization methodologies. Without the optimization part, the book can be used as a textbook in a one- or two-term undergraduate course in combinatorial and algorithmic mathematics. The optimization part can be used in a one-term high-level undergraduate course, or a low- to medium-level graduate course. The book spans xv+527 pages across 12 chapters, featuring 391 LaTeX pictures, 108 tables, and 218 illustrative examples. There are also 159 nontrivial exercises included at the end of the chapters, with complete solutions included at the end of the book. Complexity progressively grows, building upon previously introduced concepts. The book includes traditional topics as well as cutting-edge topics in modern optimization.
The Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series, after Rome (2007),Menorca(2006),Santorini(2005),RiodeJaniero(2004),Asconia(2003), and Riga (2001). This volume contains all contributed p...
The new edition of an introduction to multiagent systems that captures the state of the art in both theory and practice, suitable as textbook or reference. Multiagent systems are made up of multiple interacting intelligent agents—computational entities to some degree autonomous and able to cooperate, compete, communicate, act flexibly, and exercise control over their behavior within the frame of their objectives. They are the enabling technology for a wide range of advanced applications relying on distributed and parallel processing of data, information, and knowledge relevant in domains ranging from industrial manufacturing to e-commerce to health care. This book offers a state-of-the-art...
Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation : 2004 Book News, Inc., Portland, OR (booknews.com).
Because of the clearly important role cooperative systems play in areas such as military sciences, biology, communications, robotics, and economics, just to name a few, the study of cooperative systems has intensified. This book provides an insight in the basic understanding of cooperative systems as well as in theory, modeling, and applications of cooperative control, optimization and related problems.