A basis enumeration algorithm for linear systems with geometric applications

DOI10.1016/0893-9659(91)90141-HzbMath0736.90059MaRDI QIDQ1180318

Komei Fukuda, David Avis

Publication date: 27 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

linear systemconvex polyhedronenumeration of all basespivot-based algorithm

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Reverse search for enumeration, Extended convex hull, Tabu search and finite convergence, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values

Cites Work

• Unnamed Item
• Unnamed Item
• A finite crisscross method for oriented matroids
• A finite conformal-elimination free algorithm over oriented matroid programming
• On the finiteness of the criss-cross method
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A combinatorial abstraction of linear programming
• The Complexity of Vertex Enumeration Methods
• A convergent criss-cross method