Gems of Combinatorial Optimization and Graph Algorithms, Andreas S. Schulz; Martin Skutella; Sebastian Stil

Автор: Sundaram, Rangarajan K.
Название: A First Course in Optimization Theory
ISBN: 0521497701 ISBN-13(EAN): 9780521497701
Издательство: Cambridge Academ
Рейтинг:
Цена: 45410.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines.

Автор: Giorgio Ausiello; M. Lucertini
Название: Analysis and Design of Algorithms in Combinatorial Optimization
ISBN: 3211816267 ISBN-13(EAN): 9783211816264
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Willem-Jan van Hoeve; Elvin Coban
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISBN: 3642019285 ISBN-13(EAN): 9783642019289
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009.

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 1107007518 ISBN-13(EAN): 9781107007512
Издательство: Cambridge Academ
Рейтинг:
Цена: 85530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows.

Автор: Sanjeev Arora; Klaus Jansen; Jose D.P. Rolim; Amit
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540407707 ISBN-13(EAN): 9783540407706
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv
Название: Geometric Algorithms and Combinatorial Optimization
ISBN: 3642782426 ISBN-13(EAN): 9783642782428
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.

Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540441867 ISBN-13(EAN): 9783540441861
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, this volume contains 20 revised full papers. Coverage includes design and analysis of approximation algorithms, inapproximability results and online problems.

Автор: David Avis; Alain Hertz; Odile Marcotte
Название: Graph Theory and Combinatorial Optimization
ISBN: 1441938117 ISBN-13(EAN): 9781441938114
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field`s classical foundations and its developing theories, ideas and applications to new problems.

Автор: Andrea Lodi; Michela Milano; Paolo Toth
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISBN: 3642135196 ISBN-13(EAN): 9783642135194
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2010, held in Bologna, Italy, in June 2010.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: 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.