Интернет-магазин My-shop.ru
Персональный раздел v
   Доставка    Оплата    Скидки    Форум    Помощь
для Москвы  +7 (495) 638-53-38
бесплатно для РФ  +7 (800) 100-53-38
Data Correcting Algorithms in Combinatorial Optimization

Data Correcting Algorithms in Combinatorial Optimization

Авторы/составители: Goldengorin Boris, Pardalos Panos M.
Издательство: Springer
Серия: Springerbriefs in Optimization

Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.

6 432 руб.
в наличии*
ориентировочная дата отгрузки: 29.09.2017 (Пт.)
дата выпуска31 октября 2012 г. 
количество томов1
количество страниц126 стр.
размеры234x156x6 мм
возрастная категория18+ (нет данных)
код системы скидок25
код в My-shop.ru1393278
Бестселлеры раздела...