Matheiss, T. H.; Rubin, David S. A survey and comparison of methods for finding all vertices of convex polyhedral sets. (English) Zbl 0442.90050 Math. Oper. Res. 5, 167-185 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 81 Documents MSC: 90C05 Linear programming 90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming 65K05 Numerical mathematical programming methods 68Q60 Specification and verification (program logics, model checking, etc.) 52Bxx Polytopes and polyhedra 52A40 Inequalities and extremum problems involving convexity in convex geometry Keywords:survey; finding all vertices; convex polyhedral sets; convex polytopes; computational results; comparison of algorithms PDF BibTeX XML Cite \textit{T. H. Matheiss} and \textit{D. S. Rubin}, Math. Oper. Res. 5, 167--185 (1980; Zbl 0442.90050) Full Text: DOI OpenURL