Graph Theory and Combinatorial Optimization, David Avis; Alain Hertz; Odile Marcotte
Автор: 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.
Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi Название: Combinatorial Optimization and Graph Algorithms ISBN: 9811061467 ISBN-13(EAN): 9789811061462 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.
Автор: 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.
Автор: 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.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru