Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computational Experience with the Reverse Search Vertex Enumeration Algorithm
 

Summary: Computational Experience with the Reverse Search Vertex
Enumeration Algorithm
David Avis
School of Computer Science
McGill University
3480 University, Montreal, Quebec, Canada H3A 2A7
avis@cs.mcgill.ca
January 26, 1999
Dedicated to Professor Masao Iri on the occasion of his 65th birthday
ABSTRACT
This paper describes computational experience obtained in the development
of the lrs code, which uses the reverse search technique to solve the vertex enu­
meration/convex hull problem for d­dimensional convex polyhedra. We give
empirical results showing improvements obtained by the use of lexicographic
perturbation, lifting, and integer pivoting. We also give some indication of the
cost of using extended precision arithmetic and illustrate the use of the estimation
function of lrs. The empirical results are obtained by running various versions of
the program on a set of well­known non­trivial polyhedra: cut, configuration,
cyclic, Kuhn_Quandt, and metric polytopes.
Keywords: vertex enumeration, convex hulls, reverse search, computational expe­

  

Source: Avis, David - School of Computer Science, McGill University

 

Collections: Computer Technologies and Information Sciences