Title: A practical Example of Parallel Polyhedral Computation

The last 15 years have seen significant progress in the development of general purpose algorithms and software for polyhedral computation. Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general purpose algorithms. They are, however, highly structured and attention has turned to exploiting this structure, particularly symmetry. This talk introduces the methods used in a recent parallel implementation of an orbitwise vertex enumeration algorithm developed using MPI and run on Sharcnet clusters. This implementation made it possible to tackle previously intractable instances, and disprove a conjecture formulated in 1992 by Laurent and Poljak.