Автор: Korte Название: Combinatorial optimization theory and algorithms 4th ed. ISBN: 3540718435 ISBN-13(EAN): 9783540718437 Издательство: Springer Цена: 6265 р. Наличие на складе: Невозможна поставка. Описание: A comprehensive textbook on combinatorial optimization that puts emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It contains a chapter on facility location problems.
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 7821 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics, from leaders in the field. Exercises, examples, appendices and notes aid understanding.
Описание: This book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.
Автор: Murat Название: Probabilistic Combinatorial Optimization on Graphs ISBN: 1905209339 ISBN-13(EAN): 9781905209330 Издательство: Wiley Рейтинг: Цена: 14207 р. Наличие на складе: Поставка под заказ.
Описание: This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
Описание: This book constitutes the refereed proceedings for the 4th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2004, held in Coimbra, Portugal, in April together with EuroGP 2004 and six workshops on evolutionary computing. The 23 revised full papers presented were carefully reviewed and selected from 86 submissions. Among the topics addressed are evolutionary algorithms as well as metaheuristics like memetic algorithms, ant colony optimization, and scatter search; the papers are dealing with representations, operators, search spaces, adaptation, comparison of algorithms, hybridization of different methods, and theory. Among the combinatorial optimization problems studied are graph coloring, network design, cutting, packing, scheduling, timetabling, traveling salesman, vehicle routing, and various other real-world applications.
Описание: Emphasizing the search for patterns within and between biological sequences, trees, and graphs, this book shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic, and interactomic data. It provides an intuitive presentation of the algorithms, followed by a detailed exposition in pseudo-code. The author offers alternative implementations of the algorithms in Perl and R to enable the testing of algorithms and the building of projects based on the code.
Автор: Naumann Название: Combinatorial Scientific Computing ISBN: 1439827354 ISBN-13(EAN): 9781439827352 Издательство: Taylor&Francis Рейтинг: Цена: 9123 р. Наличие на складе: Невозможна поставка.
Описание: Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.
Автор: Author Unknown Название: HANDBOOK OF COMBINATORICS VOLUME 1,I ISBN: 0444823468 ISBN-13(EAN): 9780444823465 Издательство: Elsevier Science Рейтинг: Цена: 22468 р. Наличие на складе: Невозможна поставка.
Описание: Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 12748 р. Наличие на складе: Поставка под заказ.
Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 13580 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.
Описание: This book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005.The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem.
Описание: AlegendsaysthatJackEdmondsshouted"Eureka-youshrink "whenhefound a good characterization for matching (and the matching algorithm) in 1963, the daybeforehistalkatasummerworkshopatRANDCorporationwithcelebrities like George Dantzig, Ralph Gomory, and Alan Ho?man in the audience. During Aussois 2001, Jack con?rmed: "'Eureka - you shrink ' is really true, except that instead of 'Eureka' it maybe was some less digni?ed word." Aussois 2001 was the ?fth in an annual series of workshops on combinatorial optimization that are alternately organized by Thomas Liebling, Denis Naddef, andLaurenceWolsey-theinitiatorsofthisseries-inevenyearsandtheeditors of this book in odd years (except 1997). We decided to dedicate Aussois 2001 to Jack Edmonds in appreciation of his groundbreaking work that laid the foundations of much of what combinatorial optimizers have done in the last 35 years. Luckily, Jack is a regular participant of the Aussois workshops and, as ever, he cares a lot for young combinatorial optimizers who traditionally play a major r DEGREES ole in the Aussois series. Fig.1. Handout for the Aussois 2001 participants VI Preface Highlights of Aussois 2001 included a special session entitled "Eureka - you shrink " in honor of Jack and a special lecture by Jack on "Submodular Fu- tions, Matroids, and Certain Polyhedra" that closed the workshop. In this book, we give an account of the "Eureka - you shrink " session as well as reprints of three hardly accessible papers that Jack gave as a handout to the Aussois 2001 participants and that were originally published in theProceedings oftheCalgaryInternationalConferenceonCombinatorialStructuresandTheir Applications 1969, Gordon and Breach (1970) - newly typeset by the editors and reprinted by permission.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
