1. Computational experience with the reverse search vertex enumeration algorithm;Avis;Optim Methods Softw,1998
2. Avis D (2000) lrs: a revised implementation of the reverse search vertex enumeration algorithm. In: Kalai G, Ziegler G (eds) Polytopes–combinatorics and computation. Birkhäuser, Basel, pp 177–198
3. bwGRiD: member of the German D-Grid initiative, funded by the Ministry for Education and Research (Bundesministerium für Bildung und Forschung) and the Ministry for Science, Research and Arts Baden-Württemberg (Ministerium für Wissenschaft, Forschung und Kunst Baden-Württemberg) (2014). http://www.bw-grid.de
4. Low-dimensional 0/1-polytopes and branch-and-cut in combinatorial optimization;Christof,1997
5. Christof T, Löbel A (2009) Polyhedron representation transformation algorithm. http://comopt.ifi.uni-heidelberg.de/software/PORTA/index.html