Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  10:00-20:00 пн-пт 11-18 сб
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 

Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed., Korte, Bernhard, Vygen, Jens



Сейчас книги нет в продаже.
Возможно появится в будущем.

Автор: Korte, Bernhard, Vygen, Jens
Название:  Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.   (Комбинаторная оптимизация)
Издательство: Springer
Классификация:
Управление и методы управления
Дифферунциально и интегральное исчисление и математический анализ
Комбинаторика и теория графа
Математическая теория вычисления

ISBN: 3642244874
ISBN-13(EAN): 9783642244872
ISBN: 3-642-24487-4
ISBN-13(EAN): 978-3-642-24487-2
Обложка/Формат: Hardback
Страницы: 680
Вес: 1.14 кг.
Дата издания: 01/2012
Серия: Algorithms and combinatorics
Язык: English
Издание: 5 rev ed
Иллюстрации: Biography
Размер: 240 x 167 x 42
Читательская аудитория: Professional & vocational
Подзаголовок: Theory and algorithms
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 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 Cayleys 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.



      Старое издание
Combinatorial optimization theory and algorithms 4th ed.

Автор: 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.


Analytic Combinatorics

Автор: 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.

Combinatorial Optimization / Polyhedra and Efficiency

Автор: 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.

Algorithms in Combinatorial Geometry

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

Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Автор: Bampis Evripidis, Jansen Klaus, Kenyon Claire
Название: Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications
ISBN: 3540322124 ISBN-13(EAN): 9783540322122
Издательство: Springer
Цена: 7836 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

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

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

Combinatorial Optimization -- Eureka, You Shrink! / Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Автор: JГјnger Michael, Reinelt Gerhard, Rinaldi Giovanni
Название: Combinatorial Optimization -- Eureka, You Shrink! / Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers
ISBN: 3540005803 ISBN-13(EAN): 9783540005803
Издательство: Springer
Рейтинг:
Цена: 7314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Probabilistic Combinatorial Optimization on Graphs

Автор: 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.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings

Автор: Beck J. Christopher, Smith Barbara
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings
ISBN: 3540343067 ISBN-13(EAN): 9783540343066
Издательство: Springer
Рейтинг:
Цена: 7314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006, held in Cork, Ireland in May/June 2006.The 20 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 67 submissions. The papers address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.

Integer Programming and Combinatorial Optimization / 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings

Автор: Fischetti Matteo, Williamson David P.
Название: Integer Programming and Combinatorial Optimization / 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
ISBN: 3540727914 ISBN-13(EAN): 9783540727910
Издательство: Springer
Цена: 10449 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Автор: 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
Рейтинг:
Цена: 7314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005

Автор: BartГЎk Roman, Milano Michela
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005
ISBN: 3540261524 ISBN-13(EAN): 9783540261520
Издательство: Springer
Рейтинг:
Цена: 9926 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005, held in Prague, Czech Republic, in May/June 2005. This title presents methodological and foundational issues from AI , OR, and algorithmics.

Evolutionary Computation in Combinatorial Optimization / 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings

Автор: Raidl GГјnther R., Gottlieb Jens
Название: Evolutionary Computation in Combinatorial Optimization / 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings
ISBN: 3540253378 ISBN-13(EAN): 9783540253372
Издательство: Springer
Рейтинг:
Цена: 7314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия