×

An improved vertex enumeration algorithm. (English) Zbl 0477.90035


MSC:

90C05 Linear programming
52Bxx Polytopes and polyhedra
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[2] Dyer, M. E.; Proll, L. G., An algorithm for determining all extreme points of a convex polytope, Math. Programming, 12, 81-96 (1977) · Zbl 0378.90059
[3] Dyer, M. E.; Proll, L. G., Vertex enumeration in convex polyhedra: a comparative computational study, (Boffey, T. B., Proc. CP77 Combinatorial Programming Conference (1977), University of Liverpool: University of Liverpool Liverpool), 23-43
[5] Hadley, G., Linear Programming (1962), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0102.36304
[6] McKeown, P. G., Vertex ranking algorithms: a computational survey, (White, W. W., Computers and Mathematical Programming (1976), NBS: NBS Washington, DC), 216-222
[7] McMullen, P.; Shephard, G. C., Convex Polytopes and the Upper Bound Conjecture, (London Mathematical Society Lecture Notes Series 3 (1971), Cambridge University Press: Cambridge University Press London) · Zbl 0217.46702
[8] Manas, M.; Nedoma, J., Finding all vertices of a convex polyhedron, Numer. Math., 12, 226-229 (1968) · Zbl 0165.51801
[9] Mattheiss, T. H., An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Operations Res., 21, 247-260 (1973) · Zbl 0265.90024
[10] Mattheiss, T. H., Computational results on an algorithm for finding all vertices of a polytope, (Working paper 1 (1978), College of Commerce and Business Administration, University of Alabama) · Zbl 0433.90045
[11] Mattheis, T. H.; Rubin, D. S., A survey and comparison of methods for finding all vertices of convex polyhedral sets, (Technical Report 77-14, Curriculum in Operations Research (1977), University of North Carolina: University of North Carolina Chapel Hill) · Zbl 0442.90050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.