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

Introduction to combinatorial optimization, Du, Ding-zhu Pardalos, Panos M. Hu, Xiaodong Wu, Weili


Варианты приобретения
Цена: 6097.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: Есть  Склад Америка: Есть  
При оформлении заказа до: 2026-06-01
Ориентировочная дата поставки: Июль

Добавить в корзину
в Мои желания

Автор: Du, Ding-zhu Pardalos, Panos M. Hu, Xiaodong Wu, Weili
Название:  Introduction to combinatorial optimization
ISBN: 9783031116841
Издательство: Springer
Классификация:



ISBN-10: 3031116844
Обложка/Формат: Paperback
Страницы: 402
Вес: 0.64 кг.
Дата издания: 27.09.2023
Серия: Springer optimization and its applications
Издание: 1st ed. 2022
Иллюстрации: 132 illustrations, color; 12 illustrations, black and white; xi, 402 p. 144 illus., 132 illus. in color.
Размер: 155 x 234 x 27
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.
Дополнительное описание: 1. Introduction.-2. Divide-and-Conquer.- 3. Dynamic Programming and Shortest Path.- 4. Greedy Algorithm and Spanning Tree.- 5. Incremental Method and Maximum Network Flow.- 6. Linear Programming.- 7. Primal-Dual Methods and Minimum Cost Flow.- 8. NP-hard



Introduction to Algorithms 4E

Автор: Cormen, Thomas H.
Название: Introduction to Algorithms 4E
ISBN: 026204630X ISBN-13(EAN): 9780262046305
Издательство: Random House (USA)
Рейтинг:
Цена: 13794.00 р.
Наличие на складе: Ожидается поступление.

Описание: A comprehensive update of a widely used textbook, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Since the publication of the first edition, Introduction to Algorithms has become a widely used text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays.

Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material.

Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 14879.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.

Combinatorial optimization :

Автор: Bernhard Korte, Jens Vygen
Название: Combinatorial optimization :
ISBN: 3662560380 ISBN-13(EAN): 9783662560389
Издательство: Springer
Рейтинг:
Цена: 7927.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This comprehensive textbook on combinatorial optimization emphasizes theoretical results and algorithms with provably good performance, in contrast to heuristics. The text contains complete but concise proofs, and also provides numerous exercises and references.

Introduction to algorithms  3 ed.

Автор: Cormen, Thomas H., E
Название: Introduction to algorithms 3 ed.
ISBN: 0262033844 ISBN-13(EAN): 9780262033848
Издательство: Random House (USA)
Рейтинг:
Цена: 16553.00 р.
Наличие на складе: Нет в наличии.

Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Introduction to Applied Optimization

Автор: Diwekar Urmila M.
Название: Introduction to Applied Optimization
ISBN: 3030554066 ISBN-13(EAN): 9783030554064
Издательство: Springer
Рейтинг:
Цена: 6097.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 1. Introduction.- 2. Linear Programming.- 3. Nonlinear Programming.-4. Discrete Optimization.- 5. Optimization Under Uncertainty.- 6. Multiobjective Optimization.- 7.Optimal Control and Dynamic Optimization.- Index.

Introduction to online convex optimization, second edition

Автор: Hazan, Elad
Название: Introduction to online convex optimization, second edition
ISBN: 0262046989 ISBN-13(EAN): 9780262046985
Издательство: Random House (USA)
Рейтинг:
Цена: 5518.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Diesel That Did It tells the story of the legendary diesel-electric locomotive, the FT.

Integer and 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.

The traveling salesman problem and its variations

Автор: Gutin G., Punnen A.P.
Название: The traveling salesman problem and its variations
ISBN: 0387444599 ISBN-13(EAN): 9780387444598
Издательство: Springer
Рейтинг:
Цена: 21953.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. The book is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.

Local Search in Combinatorial Optimization

Автор: Aarts E
Название: Local Search in Combinatorial Optimization
ISBN: 0691115222 ISBN-13(EAN): 9780691115221
Издательство: Princeton UP
Рейтинг:
Цена: 10605.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Covers local search and its variants from both a theoretical and practical point of view. This book is suitable for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.

Linear ordering problem

Автор: Marti, Rafael Reinelt, Gerhard
Название: Linear ordering problem
ISBN: 3642167284 ISBN-13(EAN): 9783642167287
Издательство: Springer
Рейтинг:
Цена: 10976.00 р.
Наличие на складе: Нет в наличии.

Описание: Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.

Combinatorial optimization

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

Описание: A complete, highly accessible introduction to one of today`s most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms.

Combinatorial optimization and applications

Название: Combinatorial optimization and applications
ISBN: 3642020259 ISBN-13(EAN): 9783642020254
Издательство: Springer
Рейтинг:
Цена: 12196.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.


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