A FINITELY CONVERGENT ALGORITHM FOR BILINEAR PROGRAMMING-PROBLEMS USING POLAR CUTS AND DISJUNCTIVE FACE CUTS

被引：60

作者：

SHERALI, HD

SHETTY, CM

机构：

来源：

关键词：

D O I：

10.1007/BF01581626

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：14 / 31

页数：18

共 27 条

[1]

ALTMAN M, 1968, B ACAD POL SCI SMAP, V16, P741

BALAS, E .

[3]

BALAS E, 1973, 299 CARN MELL U MAN

[4]

BALAS E, 1974, 330 CARN MELL U MAN

[5] POLAROIDS - NEW TOOL IN NON-CONVEX AND IN INTEGER PROGRAMMING [J].

BURDET, CA .

[6]

BURDET CA, 1974, MATH PROGRAMMING THE

GLOVER, F .

[8]

Glover F., 1974, Zeitschrift fur Operations Research, Serie A (Theorie), V18, P181, DOI 10.1007/BF02026599

[9]

Grunbaum B, 1967, CONVEX POLYTOPES

[10]

JEROSLOW RG, 1974, PRINCIPLES CUTTING 1