The use of edge-directions and linear programming to enumerate vertices
From MaRDI portal
Publication:2471066
DOI10.1007/s10878-007-9063-7zbMath1157.90482OpenAlexW2069899546MaRDI QIDQ2471066
Publication date: 18 February 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9063-7
Related Items (2)
Zonotopes and the LP-Newton method ⋮ Efficient edge-skeleton computation for polytopes defined by oracles
Cites Work
- Edge-directions of standard polyhedra with applications to network flows
- Convex combinatorial optimization
- Über ein euklidisch-geometrisches Problem von B. Grünbaum
- On the equivalence between some discrete and continuous optimization problems
- The Vector Partition Problem for Convex Objective Functions
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- A Polynomial Time Algorithm for Shaped Partition Problems
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- The number of partitions of a set of N points in k dimensions induced by hyperplanes
- Partition of Space
- Inequalities: theory of majorization and its applications
This page was built for publication: The use of edge-directions and linear programming to enumerate vertices