EREADIAN

Ant Colony Optimization and Constraint Programming

Паперова, 2010, 246 с. John Wiley and Sons Ltd
Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.

Деталі

Видання
John Wiley and Sons Ltd, 2010, тверда палітурка
Видавництво
John Wiley and Sons Ltd
Сторінок
246
Мова
Англійська
ISBN
9781848211308

Ціни

Паперова, 1 пропозиція
В наявності в 1 магазині
Yakaboo
11 443 ₴

Відгуки

Ant Colony Optimization and Constraint Programming

Ще ніхто не оцінив.

Паперова, 2010, 246 с. John Wiley and Sons Ltd

Про книжку

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts.

The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages.

The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.

Деталі

Видання
John Wiley and Sons Ltd, 2010, паперова
Видавництво
John Wiley and Sons Ltd
Сторінок
246
Мова
Англійська
ISBN
9781848211308

Відгуки

Відгуків ще немає.

Ціни 1 пропозиція

ВиданняJohn Wiley and Sons Ltd, 2010
Yakaboo
В наявності
11 443 ₴

Деякі посилання на магазини — партнерські, ми можемо отримати невеликий відсоток від магазину, але це не впливає на порядок пропозицій на сайті.

Помітили неправильну ціну?