Solving Partition Problems

Name: Solving Partition Problems
Brand: VDM Verlag Dr. Müller
SKU: 9783639136210
Price: 50.87 EUR
Availability: InStock

A Branch-and-Cut Approach based on Semidefinite Programming

Автор: Bissan Ghaddar

Език:

Корици: С меки корици

Издател: VDM Verlag Dr. Müller

Наличност: Налично при издателя, по поръчка

Изпращаме след 17-27 дни

50.87 € 99.50 лв

The minimum k-partition (MkP) problem is the problem§of partitioning the set of vertices of a graph...

Информация за книгата

Автор

Bissan Ghaddar

Език

Английски език

Корици

Книга - С меки корици

Издадена

2009

страници

104

EAN

9783639136210

Enbook ID

06822299

Издател

VDM Verlag Dr. Müller

Размери

150 x 220 x 6

Пълно описание

The minimum k-partition (MkP) problem is the problem§of partitioning the set of vertices of a graph into k§disjoint subsets so as to minimize the total weight§of the edges joining vertices in the same partition.§The main contribution is the design and§implementation of a novel iterative clustering§heuristic (ICH) based on semide nite programming to nd feasible solutions for the MkP problem. We§compare ICH to the hyperplane rounding techniques,§and the computational results support the conclusion§that ICH consistently provides better feasible§solutions for the MkP problem. We use ICH in a§branch-and-cut algorithm to provide feasible§solutions at each node of the branch-and-bound tree.§The branch-and-cut algorithm computes globally§optimal solutions for dense graphs with up to 60§vertices, for grid graphs with up to 100 vertices,§and for different values of k, providing the best§exact approach to date for k 2. The minimum k-partition (MkP) problem is the problem§of partitioning the set of vertices of a graph into k§disjoint subsets so as to minimize the total weight§of the edges joining vertices in the same partition.§The main contribution is the design and§implementation of a novel iterative clustering§heuristic (ICH) based on semide nite programming to nd feasible solutions for the MkP problem. We§compare ICH to the hyperplane rounding techniques,§and the computational results support the conclusion§that ICH consistently provides better feasible§solutions for the MkP problem. We use ICH in a§branch-and-cut algorithm to provide feasible§solutions at each node of the branch-and-bound tree.§The branch-and-cut algorithm computes globally§optimal solutions for dense graphs with up to 60§vertices, for grid graphs with up to 100 vertices,§and for different values of k, providing the best§exact approach to date for k 2.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Solving Partition Problems

A Branch-and-Cut Approach based on Semidefinite Programming

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също