A CUTTING-PLANE GAME FOR FACIAL DISJUNCTIVE PROGRAMS

被引：17

作者：

JEROSLOW, RG

机构：

来源：

关键词：

D O I：

10.1137/0318018

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：264 / 281

页数：18

共 15 条

[1]

BALAS E, 1974, MSRR348 GSIA CARN ME

[2] 2 RULES FOR DEDUCING VALID INEQUALITIES FOR 0-1 PROBLEMS [J].

BLAIR, C .

[3] CONVERSE FOR DISJUNCTIVE CONSTRAINTS [J].

BLAIR, CE ;

JEROSLOW, RG .

[4]

BLAIR CE, 1979, DISJUNCTIVE PROGRAMS

[5]

Chvatal V., 1973, Discrete Mathematics, V4, P305, DOI 10.1016/0012-365X(73)90167-2

[6]

Cottle R.W., 1968, LINEAR ALGEBRA APPL, V1, P103, DOI DOI 10.1016/0024-3795(68)90052-9

[7] LINEAR COMPLEMENTARITY PROBLEM [J].

EAVES, BC .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (09) :612-634

GLOVER, F .

[9] CUTTING-PLANES FOR COMPLEMENTARITY CONSTRAINTS [J].

JEROSLOW, RG .

[10]

JEROSLOW RG, 1976, NOT AM MATH SOC, V23, pA364