Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 5358 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Edelsbrunner Herbert
Название: Algorithms in Combinatorial Geometry
ISBN: 3642648738 ISBN-13(EAN): 9783642648731
Издательство: Springer
Цена: 10721 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 10064 р.
Наличие на складе: Поставка под заказ.

Описание: 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.

Автор: Murat
Название: Probabilistic Combinatorial Optimization on Graphs
ISBN: 1905209339 ISBN-13(EAN): 9781905209330
Издательство: Wiley
Рейтинг:
Цена: 11594 р.
Наличие на складе: Поставка под заказ.

Описание: 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.

Автор: Neumann
Название: Bioinspired Computation in Combinatorial Optimization
ISBN: 3642165435 ISBN-13(EAN): 9783642165436
Издательство: Springer
Рейтинг:
Цена: 6596 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems.

Автор: RГ©gin Jean-Charles, Rueher Michel
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings
ISBN: 354021836X ISBN-13(EAN): 9783540218364
Издательство: Springer
Рейтинг:
Цена: 7177 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, held in Nice, France in April 2004.The 23 revised full papers and 7 revised short papers presented together with an invited talk were carefully reviewed and selected from 56 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

Автор: Paschos
Название: Applications of Combinatorial Optimization
ISBN: 184821149X ISBN-13(EAN): 9781848211490
Издательство: Wiley
Рейтинг:
Цена: 13651 р.
Наличие на складе: Поставка под заказ.

Описание: Combinatorial optimization is a multidisciplinary scientific area,lying in the interface of three major scientific domains:mathematics, theoretical computer science and management.

The three volumes of the Combinatorial Optimization series aimsto cover a wide range of topics in this area.

Автор: Paschos
Название: Concepts of Combinatorial Optimization
ISBN: 1848211473 ISBN-13(EAN): 9781848211476
Издательство: Wiley
Рейтинг:
Цена: 13651 р.
Наличие на складе: Поставка под заказ.

Описание: Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.

The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area.

Автор: Wolsey, Laurence A. (universite Catholique De Louv
Название: Integer and combinatorial optimization
ISBN: 0471359432 ISBN-13(EAN): 9780471359432
Издательство: Wiley
Рейтинг:
Цена: 9345 р.
Наличие на складе: Поставка под заказ.

Описание: Written by international experts in the field of integer programming, this text and reference presents the mathematical foundations, theory, and algorithms of discrete optimization methods, incorporating many techniques as well as numerous examples and model formulations.

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540204563 ISBN-13(EAN): 9783540204565
Издательство: Springer
Рейтинг:
Цена: 8246 р.
Наличие на складе: Поставка под заказ.

Описание: From the reviews:Schrijver's 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. [...] The book offers a masterly introduction with many interesting historical remarks as well as an in-depth survey of combinatorial optimization. It is divided into eight main parts with 83 chapters. The main parts are (I) paths and flows, (II) bipartite matching and covering, (III) nonbipartite matching and covering, (IV) matroids and submodular functions, (V) trees, branchings and connectors, (VI) cliques, stable sets and colouring, (VII) multiflows and disjoint paths and, finally, (VIII) hypergraphs.[...] The reader is supposed to have a basic knowledge of graph theory and linear as well as integer programming. The author gives short and elegant proofs to all main results. [...]These three volumes contain an immense richness of results up to 2002 and will prove to be indispensible for any further research in the field of combinatorial optimization.Rainer E. Burkard (Graz) Zentralblatt Math Database, 2003 [..] Now comes Schrijver's book, a current and extremely comprehensive account, running 1,451 pages; by itself the bibliography would make a long book. But even as the book provides reference material to satisfy the experts, strong undergraduates will profit by dipping straight into nearly any chapter. Mathematics and computer science students should consult it, both to supplement their theoretical coursework or to find algorithms for practical projects. Summing Up: All three books: Recommended. Upper-division undergraduates through faculty. American Library Association, 2003

Автор: Avis David, Hertz Alain, Marcotte Odile
Название: Graph Theory and Combinatorial Optimization
ISBN: 0387255915 ISBN-13(EAN): 9780387255910
Издательство: Springer
Рейтинг:
Цена: 9074 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The techniques of graph theory have been used in solving many classical problems. This book explores the field`s classical foundations and its developing theories, ideas and applications to new problems. It also examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application.

Автор: Gottlieb Jens, Raidl GГјnther R.
Название: Evolutionary Computation in Combinatorial Optimization / 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings
ISBN: 3540331786 ISBN-13(EAN): 9783540331780
Издательство: Springer
Рейтинг:
Цена: 5774 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006.The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.