Pages that link to "Item:Q2531789"

The following pages link to On the upper-bound conjecture for convex polytopes (Q2531789):

Displaying 20 items.

• Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets (Q796110) (← links)
• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
• The vertices of the knapsack polytope (Q1056676) (← links)
• Eulerian stratification of polyhedra (Q1271878) (← links)
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
• On a problem of Klee concerning convex polytopes (Q2538998) (← links)
• An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910) (← links)
• DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS (Q3406664) (← links)
• The Upper Bound Conjecture and Cohen-Macaulay Rings (Q4066168) (← links)
• Convex polytopes with convex nets (Q4069909) (← links)
• Faces and duality in convex cones (Q4180468) (← links)
• On a class of generalized simplices (Q4339977) (← links)
• (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
• The number of simplicial neighbourly <i>d</i> ‐polytopes with <i>d</i> +3 vertices (Q4771791) (← links)
• The number of neighbourly <i>d</i> ‐polytopes with <i>d</i> +3 vertices (Q4776517) (← links)
• Random Walks on Polytopes of Constant Corank (Q5116520) (← links)
• Polytopes, graphs, and complexes (Q5612292) (← links)
• Polyhedral diagrams for sections of the non‐negative orthant (Q5638902) (← links)
• A generalized lower‐bound conjecture for simplicial polytopes (Q5641742) (← links)
• Sections and projections of convex polytopes (Q5674028) (← links)