THE COMPLEXITY OF VERTEX ENUMERATION METHODS

被引：101
作者：
DYER, ME
机构：
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1983年 / 8卷 / 03期
关键词：
D O I：
10.1287/moor.8.3.381
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
44
引用
收藏
页码：381 / 402
页数：22
相关论文
共 44 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]   ALGORITHM FOR ENUMERATING ALL VERTICES OF A CONVEX POLYHEDRON [J].
ALTHERR, W .
COMPUTING, 1975, 15 (03) :181-193
[3]   ASSIGNMENT POLYTOPE [J].
BALINSKI, ML ;
RUSSAKOFF, A .
SIAM REVIEW, 1974, 16 (04) :516-525
[4]   MINIMUM NUMBER OF VERTICES OF A SIMPLE POLYTOPE [J].
BARNETTE, DW .
ISRAEL JOURNAL OF MATHEMATICS, 1971, 10 (01) :121-&
[5]   SHELLABLE DECOMPOSITIONS OF CELLS AND SPHERES [J].
BRUGGESSER, H ;
MANI, P .
MATHEMATICA SCANDINAVICA, 1971, 29 (02) :197-+
[6]   GENERATING ALL FACES OF A POLYHEDRON [J].
BURDET, CA .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (03) :479-489
[7]  
Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228
[8]   ALGORITHM FOR DETERMINING ALL EXTREME POINTS OF A CONVEX POLYTOPE [J].
DYER, ME ;
PROLL, LG .
MATHEMATICAL PROGRAMMING, 1977, 12 (01) :81-96
[9]   ELIMINATING EXTRANEOUS EDGES IN GREENBERG ALGORITHM [J].
DYER, ME ;
PROLL, LG .
MATHEMATICAL PROGRAMMING, 1980, 19 (01) :106-110
[10]  
DYER ME, 1979, 10TH S MATH PROGR MO
12345