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

Книги российских издательств

Представительство в Казахстане
 
Вход в систему
 
Войти
Регистрация  Забыли?
 
Информация
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
Политика конфиденциальности
LgBook.ru
FkBook.ru
 
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>


Combinatorial optimization theory and algorithms 4th ed., Korte

Combinatorial optimization theory and algorithms 4th ed.

Автор: Korte
Название:  Combinatorial optimization theory and algorithms 4th ed.   (Теория комбинаторной оптимизации и алгоритмов (4-е изд.))
Издательство: Springer
Классификация:
Оптимизация

ISBN: 3540718435
ISBN-13(EAN): 9783540718437
ISBN: 3-540-71843-5
ISBN-13(EAN): 978-3-540-71843-7
Обложка/Формат: Hardback
Страницы: 645
Вес: 1.078 кг.
Дата издания: 18.10.2007
Серия: Algorithms and combinatorics
Язык: ENG
Издание: 4 rev ed
Иллюстрации: 77 black & white illustrations, 2 black & white tables, 77 black & white line drawings
Размер: 235 x 155
Читательская аудитория: Professional & vocational
Рейтинг:
Поставляется из: Германии
Описание: 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.
Описание: Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided.
Дополнительное описание: Main Subject: Mathematics
Edition: 4th ed.
Bibliography: XVIII, 627 p. 77 illus.
Subtitle: Theory and Algorithms
Subject1: M17009 Combinatorics
Subject2: M26016 Calculus of Variations and Optimal Control; Optimization
Publication cl


 Добавить в Мои желания

 Варианты приобретения 
  Кол-во Наличие на складе Цена р.
1 Невозможна поставка.
4616.00
 о цене


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

в Мои желания

Combinatorial Optimization / Polyhedra and Efficiency

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

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

в Мои желания
Graph Theory and Combinatorial Optimization

Автор: Avis David, Hertz Alain, Marcotte Odile
Название: Graph Theory and Combinatorial Optimization
ISBN: 0387255915 ISBN-13(EAN): 9780387255910
Издательство: Springer
Рейтинг:
Цена: 8469 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The techniques of graph theory have been used in solving many classical problems. This book explores the field`s classical foundations and its developing theories, ideas and applications to new problems. It also examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application.

в Мои желания
Combinatorial Optimization

Автор: G?rard Cornu?jols
Название: Combinatorial Optimization
ISBN: 0898714818 ISBN-13(EAN): 9780898714814
Издательство: Cambridge Academ
Рейтинг:
Цена: 2980 р.
Наличие на складе: Поставка под заказ.

Описание: This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.

в Мои желания
Evolutionary Computation in Combinatorial Optimization / 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings

Автор: Gottlieb Jens, Raidl GГјnther R.
Название: Evolutionary Computation in Combinatorial Optimization / 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings
ISBN: 3540331786 ISBN-13(EAN): 9783540331780
Издательство: Springer
Рейтинг:
Цена: 5389 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, held in Budapest, Hungary in April 2006.The 24 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.

в Мои желания
Iterative Methods in Combinatorial Optimization

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

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

в Мои желания
Evolutionary Computation in Combinatorial Optimization

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

в Мои желания
Iterative Methods in Combinatorial Optimization

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

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

в Мои желания
Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions

Автор: JГјnger Michael, Naddef Denis
Название: Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions
ISBN: 3540428771 ISBN-13(EAN): 9783540428770
Издательство: Springer
Рейтинг:
Цена: 6159 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

в Мои желания
Combinatorial Optimization / Polyhedra and Efficiency

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

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

в Мои желания
Evolutionary Computation in Combinatorial Optimization / 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings

Автор: Gottlieb Jens, Raidl GГјnther R.
Название: Evolutionary Computation in Combinatorial Optimization / 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings
ISBN: 3540213678 ISBN-13(EAN): 9783540213673
Издательство: Springer
Рейтинг:
Цена: 5389 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings for the 4th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2004, held in Coimbra, Portugal, in April together with EuroGP 2004 and six workshops on evolutionary computing. The 23 revised full papers presented were carefully reviewed and selected from 86 submissions. Among the topics addressed are evolutionary algorithms as well as metaheuristics like memetic algorithms, ant colony optimization, and scatter search; the papers are dealing with representations, operators, search spaces, adaptation, comparison of algorithms, hybridization of different methods, and theory. Among the combinatorial optimization problems studied are graph coloring, network design, cutting, packing, scheduling, timetabling, traveling salesman, vehicle routing, and various other real-world applications.

в Мои желания
A First Course in Combinatorial Optimization

Автор: Jon Lee
Название: A First Course in Combinatorial Optimization
ISBN: 0521010128 ISBN-13(EAN): 9780521010122
Издательство: Cambridge Academ
Рейтинг:
Цена: 3154 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

в Мои желания
Evolutionary Computation in Combinatorial Optimization / 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings

Автор: Cotta Carlos, van Hemert Jano
Название: Evolutionary Computation in Combinatorial Optimization / 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings
ISBN: 3540716149 ISBN-13(EAN): 9783540716143
Издательство: Springer
Рейтинг:
Цена: 5389 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. This book covers evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, and variable neighborhood search.

в Мои желания

 
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru