Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference16 articles.
1. Balinski, M. L.: An algorithm for finding all vertices of convex polyhedral sets. J. Soc. Indust. Appl. Math.9, 72?88 (1961)
2. Chand, D. R., Kapur, S. S.: An algorithm for convex polytopes. J. Assoc. Comp. Mach.17, 78?86 (1970)
3. Chernikova, N. V.: Algorithm for finding a general formula for the nonnegative solutions of a system of linear inequalities. USSR Computational Mathematics and Mathematical Physics V, No. 2, 228?233 (1965)
4. Manas, M.: Methods for finding all vertices of a convex polyhedron. [Czech.] Ekonom.-Mat. Obzor5, 325?342 (1969)
5. Manas, M., Nedoma, J.: Finding all vertices of a convex polyhedron. Num. Math.12, 226?229 (1968)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献