Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems

This publication has 11 references indexed in Scilit:

• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
  SIAM Journal on Computing, 1994
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
  SIAM Journal on Computing, 1994
• Efficient enumeration of the vertices of polyhedra associated with network LP's
  Mathematical Programming, 1994
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
  Discrete & Computational Geometry, 1992
• On-line and off-line vertex enumeration by adjacency lists
  Operations Research Letters, 1991
• The Complexity of Vertex Enumeration Methods
  Mathematics of Operations Research, 1983
• Deciding Linear Inequalities by Computing Loop Residues
  Journal of the ACM, 1981
• A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
  SIAM Journal on Computing, 1980
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
  Mathematics of Operations Research, 1980
• An algorithm for determining all extreme points of a convex polytope
  Mathematical Programming, 1977