Quadratic convex reformulation for graph partitionning problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Quadratic convex reformulation for graph partitionning problems

Résumé

Many graph partitionning problems can be formulated by quadratic programs (QP) with binary variables and linear and quadratic constraints. We apply the general approach that consists in first reformulating the initial (QP) into an equivalent program (QP ). Problem (QP ) has the additional property that its continuous relaxation is a convex quadratic problem. It can then be solved by branch-and-bound based on quadratic convex relaxation. We show how variants of this general approach perform on many graph partitionning problems.
Fichier non déposé

Dates et versions

hal-01126262 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01126262 , version 1

Citer

Sourour Elloumi, Amélie Lambert. Quadratic convex reformulation for graph partitionning problems. IFIP TC 7 / 2013 System Modelling and Optimization, Sep 2013, Klagenfurt, Austria. pp.1. ⟨hal-01126262⟩
26 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More