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

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems, Diaby Moustapha Et Al



Варианты приобретения
Цена: 15101р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 17 фев 2025
Ориентировочная дата поставки: Март
При условии наличия книги у поставщика.

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

Автор: Diaby Moustapha Et Al
Название:  Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems
ISBN: 9789814704878
Издательство: World Scientific Publishing
Классификация:
ISBN-10: 9814704873
Обложка/Формат: Hardback
Страницы: 220
Вес: 0.532 кг.
Серия: Mathematics
Язык: English
Размер: 238 x 159 x 21
Читательская аудитория: College/higher education
Ключевые слова: Optimization, COMPUTERS / Machine Theory,MATHEMATICS / Combinatorics,MATHEMATICS / Optimization
Основная тема: Computer Science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание:

Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.

Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the traveling salesman problem (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the vertex coloring problem (VCP)). This work also represents a proof of the equality of the complexity classes P (polynomial time) and NP (nondeterministic polynomial time), and makes a contribution to the theory and application of extended formulations (EFs).

On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.


Дополнительное описание: Contents: The "Alternate TSP Polytope": A Non-Exponential Abstraction of TSP Tours; Intuition of the LP Modeling of TSP Paths; Structure of the IP Polytope; Flow Structure of the LP Polytope; Integrality of the LP Polytope; Linear Cost Function for the TS



Combinatorial Optimization / Polyhedra and Efficiency

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

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

Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

Автор: Cl?udio Alves; Francois Clautiaux; Jos? Val?rio de
Название: Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
ISBN: 3319276026 ISBN-13(EAN): 9783319276021
Издательство: Springer
Рейтинг:
Цена: 11784 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.

Integer Programming and Combinatorial Optimization

Автор: Quentin Louveaux; Martin Skutella
Название: Integer Programming and Combinatorial Optimization
ISBN: 3319334603 ISBN-13(EAN): 9783319334608
Издательство: Springer
Рейтинг:
Цена: 9796 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes therefereed proceedings of the 18th International Conference on IntegerProgramming and Combinatorial Optimization, IPCO 2016, held in Liege, Belgium,in June 2016.

On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports

Автор: Meiswinkel
Название: On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports
ISBN: 3658223618 ISBN-13(EAN): 9783658223618
Издательство: Springer
Рейтинг:
Цена: 7652 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Sebastian Meiswinkel studies optimization problems that arise at container ports from a classic optimization as well as from a mechanism design point of view. The first part of this dissertation is focused on scheduling problems with selfish job owners that have private information about their characteristics.


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