COMPUTATIONAL ASPECTS OF A BRANCH AND BOUND ALGORITHM FOR QUADRATIC ZERO-ONE PROGRAMMING

被引：178

作者：

PARDALOS, PM ^{[1
]}

RODGERS, GP ^{[1
]}

机构：

[1] IBM CORP,DIV GEN TECHNOL,BURLINGTON,VT 05452

来源：

COMPUTING | 1990年 / 45卷 / 02期

关键词：

AMS Subject Classifications: 65K05; 90C30; branch and bound; computation; Quadratic; 0-1; programming; test problems;

D O I：

10.1007/BF02247879

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we describe computational experience in solving unconstrained quadratic zero-one problems using a branch and bound algorithm. The algorithm incorporates dynamic preprocessing techniques for forcing variables and heuristics to obtain good starting points. Computational results and comparisons with previous studies on several hundred test problems with dimensions up to 200 demonstrate the efficiency of our algorithm. © 1990 Springer-Verlag.

引用

页码：131 / 144

页数：14

共 22 条

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