Solving Partition Problems

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

A Branch-and-Cut Approach based on Semidefinite Programming

Szerző: Bissan Ghaddar

Nyelv:

Kötés: Puha kötésű

Kiadó: VDM Verlag Dr. Müller

Elérhetőség: Kiadói készleten rendelésre

Küldés 17-27 napon belül

17 249 Ft

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

Információk a könyvről

Szerző

Bissan Ghaddar

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2009

oldal

104

EAN

9783639136210

Enbook ID

06822299

Kiadó

VDM Verlag Dr. Müller

Méretek

150 x 220 x 6

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Solving Partition Problems

A Branch-and-Cut Approach based on Semidefinite Programming

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták