%0 Report %T A Parallel probabilistic algorithm to find "all" vertices of a polytope %+ ParaDis %A Lavallee, Ivan %A Duong, Pham Canh %Z Projet PARADIS %N RR-1813 %I INRIA %8 1992 %D 1992 %Z Computer Science [cs]/Other [cs.OH]Reports %X This paper presents a new parallel algorithm to find all vertices of a convex polytope. This algorithm is of Monte-Carlo type and requires no assumption of problem nondegeneracy. Redundant constraints have no influence on the main computation. The vertex locating routine uses a new algorithm for nearest point problem in polytopes. %G English %2 https://inria.hal.science/inria-00074859/document %2 https://inria.hal.science/inria-00074859/file/RR-1813.pdf %L inria-00074859 %U https://inria.hal.science/inria-00074859 %~ INRIA %~ INRIA-ROCQ %~ INRIA-RRRT %~ TESTALAIN1 %~ INRIA2 %~ LARA