CONSTRUCTION OF TEST PROBLEMS IN QUADRATIC BIVALENT PROGRAMMING

被引：40

作者：

PARDALOS, PM

机构：

[1] Pennsylvania State Univ., University Park

来源：

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1991年 / 17卷 / 01期

关键词：

GLOBAL OPTIMIZATION; INTEGER QUADRATIC PROGRAMMING; TEST PROBLEMS;

D O I：

10.1145/103147.103156

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A method of constructing test problems for constrained bivalent quadratic programming is presented. For any feasible integer point of a given domain, the method generates quadratic functions whose minimum over the given domain occurs at the selected point. Certain properties of unconstrained quadratic zero-one programs that determine the difficulty of the test problems are also discussed. In addition, a standardized random test problem generator for unconstrained quadratic zero-one programming is given.

引用

页码：74 / 87

页数：14

共 23 条

[1] THE CONSTRUCTION OF TEST PROBLEMS IN INTEGER-VALUE PROGRAMMING WITH BINARY UNKNOWNS [J].

BABAEV, RD .

USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1985, 25 (01) :98-102

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

BARAHONA, F ;

JUNGER, M ;

REINELT, G .

MATHEMATICAL PROGRAMMING, 1989, 44 (02) :127-137

[3] A SOLVABLE CASE OF QUADRATIC 0-1 PROGRAMMING [J].

BARAHONA, F .

DISCRETE APPLIED MATHEMATICS, 1986, 13 (01) :23-26

[4] THE INDEFINITE ZERO-ONE QUADRATIC PROBLEM [J].

CARTER, MW .

DISCRETE APPLIED MATHEMATICS, 1984, 7 (01) :23-44

[5]

CHANG MG, 1982, LECT NOTES ECON MATH, V199, P146

[6]

COOPER M, 1980, MANAGE SCI, V3, P132

[7]

GIANNESSI F, 1976, S MATH, V19, P161

[8]

GULATI VP, 1981, EUR J OPER RES, V15, P121

[9]

Hammer P.L., 1987, ANN DISCRETE MATH, V31, P83

[10]

HAMMER PL, 1969, BOOLEAN METHODS OPER

← 1 2 3 →