Solving Partition Problems

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

A Branch-and-Cut Approach based on Semidefinite Programming

Autor: Bissan Ghaddar

Jazyk:

Väzba: Brožovaná

Vydavateľ: VDM Verlag Dr. Müller

Dostupnosť: U vydavateľa na objednávku

Odosielame za 17-27 dní

48.52 €

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

Informácie o knihe

Autor

Bissan Ghaddar

Jazyk

Angličtina

Väzba

Kniha - Brožovaná

Vydalo

2009

Stránok

104

EAN

9783639136210

Enbook ID

06822299

Vydavateľ

VDM Verlag Dr. Müller

Rozmery

150 x 220 x 6

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Solving Partition Problems

A Branch-and-Cut Approach based on Semidefinite Programming

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež