Solving Partition Problems

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

A Branch-and-Cut Approach based on Semidefinite Programming

Autor: Bissan Ghaddar

Jazyk:

Vazba: Brožovaná

Vydavatel: VDM Verlag Dr. Müller

Dostupnost: U nakladatele na objednávku

Odesíláme za 17-27 dnů

1 173 Kč

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

Informace o knize

Autor

Bissan Ghaddar

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2009

Stránek

104

EAN

9783639136210

Enbook ID

06822299

Vydavatel

VDM Verlag Dr. Müller

Rozměry

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 zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Solving Partition Problems

A Branch-and-Cut Approach based on Semidefinite Programming

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také