Abstract
This paper describes the development of lrs, an implementation of the reverse search method to the vertex enumeration/convex hull problem for convex polyhedra. We describe an important and difficult class of polyhedra, called configuration polytopes, that have application to determining the ground states of alloy phase diagrams. Experience gained while trying to solve these problems lead to a number of improvements to the original implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Fukuda, K.: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discrete and Computational Geometry 8, 295–313 (1992)
Avis, D., Devroye, L.: Estimating the Number of Vertices of a Polyhedron. In: Avis, D., Bose, P. (eds.) Snapshots of Computational and Discrete Geometry, McGill University. School of Computer Science, vol. 3, pp. 179–190 (1994), ftp://mutt.cs.mcgill.ca/pub/doc/avis/AD94a.ps.gz
Avis, D.: A C Implementation of the Reverse Search Vertex Enumeration Algorithm. In: Imai, H. (ed.) RIMS Kokyuroku 872, Kyoto University (May 1994), ftp://mutt.cs.mcgill.ca/pub/doc/avis/Av94a.ps.gz
Avis, D., Bremner, D., Seidel, R.: How Good are Convex Hull Algorithms? Computational Geometry: Theory and Applications 7, 265–301 (1997)
Avis, D.: Computational Experience with the Reverse Search Vertex Enumeration Algorithm. Optimization Methods and Software 10, 107–124 (1998)
Avis, D.: Irs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm (May 1998), ftp://mutt.cs.mcgill.ca/pub/doc/avis/Av98a.ps.gz
Brllngger, A., Marzetta, A., Fukuda, K., Nievergelt, J.: The Parallel Search Bench ZRAM and its Applications (1997), ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports
Ceder, G., Garbulsky, G.D., Avis, D., Fukuda, K.: Ground States of a Ternary Lattice Model with Nearest and Next-Nearest Neighbor Interactions. Physical Review B 49, 1–7 (1994)
Chvatal, V.: Linear Programming. W.H. Freeman, New York (1983)
Deza, A., Fukuda, K.: McMullen’s Conditions and some Lower Bounds for General Convex Polytopes. Geometriae Dedicata 52, 165–173 (1994)
Ducastelle, F.: Order and Phase Stability in Alloys. North-Holland, Amsterdam (1991)
Edmonds, J., Maurras, J.-F.: Note sur les Q-matrices d’Edmonds. Recherche Operationelle (RAIRO) 31, 203–209 (1997)
Hall, M., Knuth, D.E.: Combinatorial Analysis and Computers. Am. Math. Monthly 72, 21–28 (1965)
Ignizio, J., Cavalier, T.: Linear Programming. Prentice Hall, Englewood Cliffs (1994)
Kaburagi, M., Kanamori, J.: A Method of Determining the Ground State of the Extended Range Classical Lattice Gas Model. Progress in Theoretical Physics 54, 30–44 (1975)
Klee, V.: Polytope Pairs and Their Relationship to Linear Programming. Acta Math. CXXXIII, 1–25 (1974)
Matheiss, T.H.: An Algorithm for Determining Irrelevant Constraints and All Vertices in Systems of Linear Inequlaties. Operations Research 21, 247–260 (1973)
Ziegler, G.: Lectures on Polytopes. Springer, Heidelberg (1994); revised. Graduate Texts in Mathematics (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avis, D. (2000). Living with lrs . In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive