Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

被引：135

作者：

Helmberg, C

Rendl, F

机构：

[1] Konrad Zuse Zentrum Informat Tech Berlin, D-14195 Berlin, Germany

[2] Graz Tech Univ, Inst Math, A-8010 Graz, Austria

来源：

MATHEMATICAL PROGRAMMING | 1998年 / 82卷 / 03期

关键词：

quadratic; (0; l)-programming; max-cut problem; semidefinite program; branch and bound;

D O I：

10.1007/BF01580072

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present computational experiments for solving quadratic (0, 1) problems. Our approach combines a semidefinite relaxation with a cutting plane technique, and is applied in a Branch and Bound setting. Our experiments indicate that this type of approach is very robust, and allows to solve many moderately sized problems, having say, less than 100 binary variables, in a routine manner. (C) 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

引用

页码：291 / 315

页数：25

共 45 条

[1] EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING [J].