Geometric Algorithms and Combinatorial Optimization, Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv

Автор: Sundaram, Rangarajan K.
Название: A First Course in Optimization Theory
ISBN: 0521497701 ISBN-13(EAN): 9780521497701
Издательство: Cambridge Academ
Рейтинг:
Цена: 6811.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines.

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

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

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

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

Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil
Название: Gems of Combinatorial Optimization and Graph Algorithms
ISBN: 3319249703 ISBN-13(EAN): 9783319249704
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Название: Handbook of Combinatorial Optimization. Print + eReference Information Print + eReference
ISBN: 1461439752 ISBN-13(EAN): 9781461439752
Издательство: Springer
Рейтинг:
Цена: 436734.00 р.
Наличие на складе: Поставка под заказ.

Описание: Handbook of Combinatorial Optimization

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

Описание: Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.

Автор: Ding-Zhu Du, Pardalos, Panos M.
Название: Handbook of combinatorial optimization
ISBN: 0792350197 ISBN-13(EAN): 9780792350194
Издательство: Springer
Рейтинг:
Цена: 48774.00 р.
Наличие на складе: Поставка под заказ.

Описание: Deals with several algorithmic approaches for discrete problems as well as combinatorial problems. This book attempts to bring together various aspects of the this field with emphasis on developments. It is intended for researchers in discrete optimization, and scientists who use combinatorial optimization methods to model and solve problems.

Название: Combinatorial optimization and applications
ISBN: 3642020259 ISBN-13(EAN): 9783642020254
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.

Название: Combinatorial and global optimization
ISBN: 9810248024 ISBN-13(EAN): 9789810248024
Издательство: World Scientific Publishing
Рейтинг:
Цена: 15048.00 р.
Наличие на складе: Поставка под заказ.

Описание: Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, and biological and computer science. This is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete.

Название: Handbook of Combinatorial Optimization eReference Information . eReference 1-5 vol
ISBN: 1441979964 ISBN-13(EAN): 9781441979964
Издательство: Springer
Рейтинг:
Цена: 349388.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This seven-volume resource serves as a basic, yet comprehensive reference work in combinatorial optimization. It deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems.