Parallel implementation for orbitwise vertex enumeration algorithms
A polyhedron is a set of solutions to a finite system of linear inequalities. The vertex enumeration problem consists of taking such system of linear inequalities that defines the polyhedron and output its vertices. For degenerate and high dimensional polyhedra this problem is usually solved by algorithms using the Fourier-Motzkin double description method. My work involves enhancing, implementing and parallelizing newly introduced enumeration algorithms for combinatorial polytopes with large symmetry groups in order to tackle problems that until now have been intractable.
Key words: parallel computing, enumeration algorithms, combinatorial polyhedra.