Quadratic convex reformulation for graph partitionning problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Quadratic convex reformulation for graph partitionning problems

Abstract

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-01126262 , version 1

Cite

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⟩

Collections

CNAM CEDRIC-CNAM
22 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More