Reference7 articles.
1. Grünbaum B (1967) Covex polytopes. Wiley, NY
2. Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V (2006) Generating all vertices of a polyhedron is Hard. RUTCOR, Rutgers University, NJ
3. Murty KG (1971) Adjacency on convex polyhedra. SIAM Rev 13(3):377–386
4. Murty KG (2009) A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes. Optim Lett 3(2):211–237
5. Murty KG, Chung SJ (1995) Segments in enumerating facets. Math Program 70:27–45 PORTA (Polyhedron Representation Transformation Algorithm), a software package for enumerating the extreme points of a convex polyhedron specified by linear constraints, can be downloaded from the website: http://www.iwr.uni-heidelberg.de/groups/comopt/software/PORTA/
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献