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

Combinatorial Optimization / Polyhedra and Efficiency, Schrijver Alexander



Варианты приобретения
Цена: 18116р.
Кол-во:
 о цене
Наличие: Отсутствует. 
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа


Заказ пока невозможен
в Мои желания

Автор: Schrijver Alexander
Название:  Combinatorial Optimization / Polyhedra and Efficiency
Перевод названия: Комбинаторная оптимизация / многогранники и эффективность
ISBN: 9783540443896
Издательство: Springer
Классификация:
ISBN-10: 3540443894
Обложка/Формат: Hardback
Страницы: 1988
Вес: 3.326 кг.
Дата издания: 10.12.2002
Серия: Algorithms and combinatorics
Язык: English
Иллюстрации: Vol. a: xxxviii, 648 s. vol. b: xxxiv, 570 s. vol
Размер: 242 x 158 x 54
Читательская аудитория: Postgraduate, research & scholarly
Подзаголовок: Polyhedra and efficiency
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Дополнительное описание: Формат: 235x155
Круг читателей: Mathematicians, computer scientists, operations researchers, economists
Ключевые слова: combinatorial optimization
graph theory
integer programming
polyhedral combinatorics
polynomial-time algorithms
Язык: eng
Оглавление: Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index.





Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

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

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

Evolutionary Computation in Combinatorial Optimization

Автор: Jano van Hemert; Carlos Cotta
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3540786031 ISBN-13(EAN): 9783540786030
Издательство: Springer
Рейтинг:
Цена: 10394 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 8th European Conference EvoCOP 2008 Naples Italy March 26-28 2008 Proceedings.

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

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

Combinatorial Optimization / Polyhedra and Efficiency

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

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

Algorithms in Combinatorial Geometry

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

Iterative Methods in Combinatorial Optimization

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 0521189438 ISBN-13(EAN): 9780521189439
Издательство: Cambridge Academ
Рейтинг:
Цена: 7410 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. 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. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Combinatorial optimization

Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R
Название: Combinatorial optimization
ISBN: 047155894X ISBN-13(EAN): 9780471558941
Издательство: Wiley
Рейтинг:
Цена: 28496 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Combinatorial optimization is a topic in discrete mathematics and theoretical computer science. This book covers the theory, algorithms and applications in a manner which should be accessible to researchers and post graduate students in mathematics and computer science.

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

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

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

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

Iterative Methods in Combinatorial Optimization

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 1107007518 ISBN-13(EAN): 9781107007512
Издательство: Cambridge Academ
Рейтинг:
Цена: 13737 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. 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. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Probabilistic Combinatorial Optimization on Graphs

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

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

Combinatorial Optimization

Автор: Korte
Название: Combinatorial Optimization
ISBN: 3540256849 ISBN-13(EAN): 9783540256847
Издательство: Springer
Цена: 7418 р.
Наличие на складе: Нет в наличии.

Описание: This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.From the reviews of the 2nd edition:"This book on combinatorial optimization is a beautiful example of the ideal textbook."Operations Resarch Letters 33 (2005), p.216-217"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."OR News 19 (2003), p.42 


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