ABSTRACT
Vertex Enumeration (VE) algorithms involved with finding and generating (listing) all or some of the extreme points that lie at corners of convex polyhedron formed by systems of linear equations or inequalities. An updated review is presented in (Abdullahi, 2002).
