The following pages link to Segments in enumerating faces (Q1904658):
Displayed 6 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
- A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731) (← links)
- Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
- Finding and identifying optimal inventory levels for systems with common components (Q2519082) (← links)