The following pages link to (Q5817857):
Displayed 25 items.
- Bell-type inequalities for quasi-copulas (Q703390) (← links)
- Computing extreme rays of the metric cone for seven points (Q1193551) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- A counterexample to Greenberg's algorithm for solving linear inequalities (Q1238400) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- Zero polyhedral cones (Q1431847) (← links)
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals (Q1602997) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- The generalized linear complementarity problem and an algorithm to find all its solutions (Q1802954) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra (Q1916031) (← links)
- Finding all vertices of a convex polyhedron (Q2530169) (← links)
- A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities (Q2542393) (← links)
- A sweep-plane algorithm for generating random tuples in simple polytopes (Q4210961) (← links)
- Statistical decision analysis of stochastic linear programming problems (Q5548072) (← links)
- Motivation for working in numerical analysis (Q5848532) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)
- Model predictive control for perturbed max-plus-linear systems (Q5958238) (← links)