Listing vertices of simple polyhedra associated with dual LI(2) systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2731, Issue , 2003, Pages 89-96

  Abdullahi, Sammani D ^a   Dyer, Martin E ^a   Proll, Les G ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; TREES (MATHEMATICS);

SUBGRAPHS;

GRAPH THEORY;

EID: 33645596271     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45066-1_6     Document Type: Article

References (19)

1. S.D. Abdullahi. Vertex Enumeration and Counting for Certain Classes of Polyhedra. PhD thesis, School of Computing, The University of Leeds, 2002.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Weslcy, Heading, Mass, 1982.
3. B. Aspvall and Y. Shiloach. Polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing, 9:827-845, 1980.
4. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration for arrangements and polyhedra. Discrete Computational Geometry, 8:295-313, 1992.
5. P.-C. Chen, P. Hansen and B. Jaumard. On-line and off-line vertex enumeration by adjacency lists. Operations Research Letters, 10:403-409, 1991.
6. E. Cohen and N. Megiddo. Improved algorithms for linear inequalities with two variables per inequality. SIAM Journal on Computing, 23:1313-1347, 1994.
7. G.B. Dantzig. Linear Programming and Extensions. Princeton University Press, N.J., 1963.
8. M.E. Dyer. Vertex Enumeration in Mathematical Programming: Methods and Applications. PhD thesis, The University of Leeds, October 1979.
9. M.E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8:381-402, 1983.
10. M.E. Dyer and L.G. Proll. Vertex enumeration in convex polyhedra: a comparative computational study. In T. B Boffey, editor, Proceedings of the CP77 Combinatorial Programming Conference, pages 23-43, University of Liverpool, Liverpool, 1977.
11. M.E. Dyer and L.G. Proll. An algorithm for determining all extreme points of a convex polytope. Mathematical Programming, 12:81-96, 1977.
12. D.S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer program with two variables per inequality. SIAM Journal of Computing, 23:1179-1192, 1994.
13. J.L. Kennington and U.V. Helgason. Algorithms for Network Programming. John Wiley and Sons, Inc., 1980.
14. D.E. Knuth. The Art of Computer Programming Vol. 3: Sorting and Searching. Addison-Wesley, 1973.
15. T.H. Mattheiss and D.S. Rubin. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Mathematics of Operations Research, 5:167-185, 1980.
16. S.B. Ong, M.E. Dyer, and L.G. Proll. A comparative study of three vertex enumeration algorithms. Technical report, School of Computer Studies, University of Leeds, 1996.
17. J. Scott Provan. Efficient enumeration of the vertices of polyhedra associated with network LP's. Mathematical Programming, 64:47-64, 1994.
18. R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the Association for Computing Machinery, 28:769-779, 1981.
19. H.P. Williams. Fourier's method of linear programming and its dual. American Mathematical Monthly, 93:681-694, 1986.