|
 
|
[EL13] Quadratic convex reformulation for graph partitionning problems
Conférence Internationale avec comité de lecture : IFIP TC 7 / 2013 System Modelling and Optimization, September 2013, pp.1, Klagenfurt, Austria,Mots clés: Quadratic programming ; integer programming ; graph partitionning
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.
Equipe:
oc
BibTeX
| @inproceedings { | |||
| EL13, | |||
| title | = | "{Quadratic convex reformulation for graph partitionning problems }", | |
| author | = | " S. Elloumi and A. Lambert ", | |
| booktitle | = | "{IFIP TC 7 / 2013 System Modelling and Optimization}", | |
| year | = | 2013, | |
| month | = | "September", | |
| pages | = | "1", | |
| address | = | "Klagenfurt, Austria", | |
| } | |||
