A basis enumeration algorithm for linear systems with geometric applications
From MaRDI portal
Publication:1180318
DOI10.1016/0893-9659(91)90141-HzbMath0736.90059MaRDI QIDQ1180318
Publication date: 27 June 1992
Published in: Applied Mathematics Letters (Search for Journal in Brave)
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C27: Combinatorial optimization
05B35: Combinatorial aspects of matroids and geometric lattices
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
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, Reverse search for enumeration
Cites Work
- 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
- Unnamed Item
- Unnamed Item