Solving Partition Problems

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

A Branch-and-Cut Approach based on Semidefinite Programming

Autor: Bissan Ghaddar

Język:

Oprawa: Miękka

Wydawca: VDM Verlag Dr. Müller

Dostępność: Na zamówienie

Wysyłamy za 17-27 dni

205.41 zł

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

Informacje o książce

Autor

Bissan Ghaddar

Język

Angielski

Oprawa

Książka - Miękka

Data wydania

2009

strony

104

EAN

9783639136210

Enbook ID

06822299

Wydawca

VDM Verlag Dr. Müller

Wymiary

150 x 220 x 6

Pełny opis

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.

Możesz być zainteresowany

Klienci, którzy kupili tę książkę, kupili również

Najczęściej wyszukiwane

Categories

Authors

Publishers

Produkty

Produkty

Najczęściej wyszukiwane

Categories

Authors

Publishers

Produkty

Produkty

Solving Partition Problems

A Branch-and-Cut Approach based on Semidefinite Programming

Informacje o książce

Pełny opis

Możesz być zainteresowany

Klienci, którzy kupili tę książkę, kupili również