Journal of Combinatorial Optimization

, Volume 14, Issue 2–3, pp 153–164 | Cite as

The use of edge-directions and linear programming to enumerate vertices

  • Shmuel OnnEmail author
  • Uriel G. Rothblum


Given a list of vectors that contains directions of the edges of a given polytope ℘ and the availability of an algorithm that solves linear programs over ℘, we describe a method for enumerating the vertices of ℘; in particular, the method is adaptable to polytopes which are presented as (linear) projections of polytopes having linear inequality representation. Polynomial complexity bounds under both the real and the binary computation models are derived when the dimension of the polytope is fixed and the given LP algorithm is polynomial.


Vertices Polytopes Edge-directions Linear programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Buck RC (1943) Partition of space. Am Math Mon 50:541–544 zbMATHCrossRefMathSciNetGoogle Scholar
  2. Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York Google Scholar
  3. Edelsbrunner H, O’Rourke J, Seidel R (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J Comput 15:341–363 zbMATHCrossRefMathSciNetGoogle Scholar
  4. Edelsbrunner H, Seidel R, Sharir M (1991) On the zone theorem for hyperplane arrangements. In: New results and trends in computer science. Lecture notes in computer science, vol 555. Springer, Berlin, pp 108–123 CrossRefGoogle Scholar
  5. Gritzmann P, Sturmfels B (1993) Minkowski addition of polytopes: complexity and applications to Gröbner bases. SIAM J Discret Math 6:246–269 zbMATHCrossRefMathSciNetGoogle Scholar
  6. Grünbaum B (1967) Convex polytopes. Wiley, New York zbMATHGoogle Scholar
  7. Harding EF (1967) The number of partitions of a set of n points in k dimensions induced by hyperplanes. In: Proceedings of the Edinburgh mathematical society, vol 15, pp 285–289 Google Scholar
  8. Hwang FK, Rothblum UG (1996) Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math Oper Res 21:540–554 zbMATHCrossRefMathSciNetGoogle Scholar
  9. Hwang FK, Onn S, Rothblum UG (1999) A polynomial time algorithm for shaped partition problems. SIAM J Optim 10:70–81 zbMATHCrossRefMathSciNetGoogle Scholar
  10. Marshall AW, Olkin I (1979) Inequalities: theory of majorization and its applications. Academic, New York zbMATHGoogle Scholar
  11. Onn S, Rothblum UG (2004) Convex combinatorial optimization. Discret Comput Geom 32:549–566 zbMATHCrossRefMathSciNetGoogle Scholar
  12. Onn S, Schulman LJ (2001) The vector partition problem for convex objective functions. Math Oper Res 26:583–590 zbMATHCrossRefMathSciNetGoogle Scholar
  13. Onn S, Rothblum UG, Tangir Y (2005) Edge-directions of polyhedra with applications to network flows. J Global Optim 33:109–122 zbMATHCrossRefMathSciNetGoogle Scholar
  14. Rockaffelar RT (1984) Network flows and monotropic optimization. Pure and applied mathematics. Wiley–Interscience, New York Google Scholar
  15. Schulz AS, Weismantel R, Ziegler G (1995) (0,1)-integer programming: optimization and augmentation are equivalent. In: Proceedings of the third annual European symposium on algorithms. Lecture notes in computer science, vol 979. Springer, Berlin, pp 473–483 Google Scholar
  16. Tardella F (1990) On the equivalence between some discrete and continuous optimization problems. Ann Oper Res 25:291–300 zbMATHCrossRefMathSciNetGoogle Scholar
  17. Zaslavsky T (1975) Facing up to arrangements: face count formulas for partitions of space by hyperplanes. Mem Am Math Soc 154 Google Scholar
  18. Ziegler GM (1995) Lecture notes on polytopes. Graduate texts in mathematics. Springer, New York Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Technion—Israel Institute of TechnologyHaifaIsrael

Personalised recommendations