POLYTOPE PAIRS AND THEIR RELATIONSHIP TO LINEAR-PROGRAMMING

被引：21

作者：

KLEE, V ^{[1
]}

机构：

[1] UNIV WASHINGTON,SEATTLE,WA 98195

来源：

关键词：

D O I：

10.1007/BF02392139

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：1 / 25

页数：25

共 27 条

[1] GRAPH THEOREMS FOR MANIFOLDS [J].

BARNETTE, D .

[2] MINIMUM NUMBER OF VERTICES OF A SIMPLE POLYTOPE [J].

BARNETTE, DW .

[3] HISTORICAL NOTE ON A RECURRENT COMBINATORIAL PROBLEM [J].

BROWN, WG .

[4]

BRUGGESSER H, 1972, MATH SCAND, V29, P197

[5]

Dantzig G.B., 1998, Linear programming and extensions, V48

[6]

DANTZIG GB, 1964, B AM MATH SOC, V70, P499

[7] ON NUMBER OF FACES OF CONVEX POLYTOPE [J].

GALE, D .

CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (01) :12-&

[8]

GALE D, 1963, P S PURE MATH, V7, P255

[9]

Gale D., 1956, ANN MATH STUD, V38, P255

[10]

Grnbaum B., 1967, J COMB THEORY, V2, P437, DOI 10.1016/S0021-9800(67)80055-3