Pages that link to "Item:Q1334609"

The following pages link to Combinatorial face enumeration in convex polytopes (Q1334609):

Displaying 31 items.

• Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
• Face enumeration-from spheres to manifolds (Q1024254) (← links)
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731) (← links)
• Completely unimodal numberings of a simple polytope (Q1107444) (← links)
• Combinatorial face enumeration in arrangements and oriented matroids (Q1175785) (← links)
• A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
• Primal-dual methods for vertex and facet enumeration (Q1272960) (← links)
• Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
• Scenario-based portfolio model for building robust and proactive strategies (Q1754078) (← links)
• Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
• On local transformation of polygons with visibility properties. (Q1853571) (← links)
• Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
• Computing the face lattice of a polytope from its vertex-facet incidences (Q1862131) (← links)
• Segments in enumerating faces (Q1904658) (← links)
• Complexity and algorithms for Euler characteristic of simplicial complexes (Q1930164) (← links)
• Computing the bounded subcomplex of an unbounded polyhedron (Q1941218) (← links)
• A combinatorial proof of the cyclic sieving phenomenon for faces of coxeterhedra (Q1956252) (← links)
• Counting faces in the extended Shi arrangement (Q2002049) (← links)
• Vertex labeling of a half-cube to induce face labels in arithmetic progression (Q2088975) (← links)
• A new face iterator for polyhedra and for more general finite locally branched lattices (Q2136840) (← links)
• The Minkowski sum of simplices in 3-dimensional space. An analytical description (Q2248741) (← links)
• Polyhedral omega: a new algorithm for solving linear Diophantine systems (Q2363492) (← links)
• On planar path transformation (Q2379998) (← links)
• The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
• Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
• Enumeration of the facets of cut polytopes over some highly symmetric graphs (Q2827757) (← links)
• On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
• A validation and verification tool for global optimization solvers (Q3598649) (← links)
• On the complexity of a representation of a convex polyhedron in \(R^ 3\) (Q3979861) (← links)
• The aggregate capacity of virtual resources – linear models (Q5169447) (← links)