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

Journal of Combinatorial Optimization

Volumn 14, Issue 2-3, 2007, Pages 153-164

  Onn, Shmuel ^a   Rothblum, Uriel G ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Edge directions; Linear programming; Polytopes; Vertices

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR MATRIX INEQUALITIES; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION;

BINARY COMPUTATION; EDGE-DIRECTIONS; POLYTOPES; VERTICES;

LINEAR PROGRAMMING;

EID: 34548092419     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9063-7     Document Type: Conference Paper

References (18)

1. Buck RC (1943) Partition of space. Am Math Mon 50:541-544
2. Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York
3. Edelsbrunner H, O'Rourke J, Seidel R (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J Comput 15:341-363
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
5. Gritzmann P, Sturmfels B (1993) Minkowski addition of polytopes: complexity and applications to Gröbner bases. SIAM J Discret Math 6:246-269
6. Grünbaum B (1967) Convex polytopes. Wiley, New York
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
8. Hwang FK, Rothblum UG (1996) Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math Oper Res 21:540-554
9. Hwang FK, Onn S, Rothblum UG (1999) A polynomial time algorithm for shaped partition problems. SIAM J Optim 10:70-81
10. Marshall AW, Olkin I (1979) Inequalities: theory of majorization and its applications. Academic, New York
11. Onn S, Rothblum UG (2004) Convex combinatorial optimization. Discret Comput Geom 32:549-566
12. Onn S, Schulman LJ (2001) The vector partition problem for convex objective functions. Math Oper Res 26:583-590
13. Onn S, Rothblum UG, Tangir Y (2005) Edge-directions of polyhedra with applications to network flows. J Global Optim 33:109-122
14. Rockaffelar RT (1984) Network flows and monotropic optimization. Pure and applied mathematics. Wiley-Interscience, New York
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
16. Tardella F (1990) On the equivalence between some discrete and continuous optimization problems. Ann Oper Res 25:291-300
17. Zaslavsky T (1975) Facing up to arrangements: face count formulas for partitions of space by hyperplanes. Mem Am Math Soc 154
18. Ziegler GM (1995) Lecture notes on polytopes. Graduate texts in mathematics. Springer, New York