Pages that link to "Item:Q1199131"

The following pages link to A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131):

Displaying 50 items.

• The symplectic geometry of closed equilateral random walks in 3-space (Q259598) (← links)
• Explicit robustness and fragility margins for linear discrete systems with piecewise affine control law (Q273993) (← links)
• Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
• A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
• A thrust network approach to the equilibrium problem of unreinforced masonry vaults via polyhedral stress functions (Q366433) (← links)
• A mixed lumped stress-displacement approach to the elastic problem of masonry walls (Q366690) (← links)
• On the calculation of a membership function for the solution of a fuzzy linear optimization problem (Q423156) (← links)
• On perfect Nash equilibria of polymatrix games (Q457873) (← links)
• A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
• Characterizing coherence, correcting incoherence (Q473384) (← links)
• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
• The two variable per inequality abstract domain (Q656848) (← links)
• An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
• Error control in polytope computations (Q700748) (← links)
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
• Finiteness of relative equilibria of the four-body problem (Q818632) (← links)
• A linear optimization oracle for zonotope computation (Q824329) (← links)
• Enumeration of Nash equilibria for two-player games (Q847809) (← links)
• An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
• The stable set polytope of icosahedral graphs (Q898118) (← links)
• Graph decompositions for demographic loop analysis (Q938191) (← links)
• On polyhedral projection and parametric programming (Q939122) (← links)
• Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
• Flips in planar graphs (Q950400) (← links)
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
• Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732) (← links)
• Generalized pattern search methods for a class of nonsmooth optimization problems with structure (Q1023336) (← links)
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731) (← 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)
• A reverse search algorithm for the neighborhood problem (Q1306348) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
• Combinatorial face enumeration in convex polytopes (Q1334609) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• How good are convex hull algorithms? (Q1356937) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
• An algorithm for approximate multiparametric linear programming (Q1431701) (← links)
• Tabu search and finite convergence (Q1602700) (← links)
• Multiparametric demand transportation problem (Q1604061) (← links)
• Estimating the number of vertices of a polyhedron (Q1607035) (← links)
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
• Fluid approximation of Petri net models with relatively small populations (Q1677193) (← links)
• A procedure for computing the log canonical threshold of a binomial ideal (Q1692190) (← links)
• Errors bounds for finite approximations of coherent lower previsions on finite probability spaces (Q1726342) (← links)
• On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers (Q1745312) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• Scenario-based portfolio model for building robust and proactive strategies (Q1754078) (← links)