The following pages link to (Q5817857):
Displaying 50 items.
- Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization (Q255113) (← links)
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- Saddle points and scalarizing sets in multiple objective linear programming (Q406635) (← links)
- Increasing interdependence of multivariate distributions (Q435910) (← links)
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction (Q649238) (← 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)
- Bell-type inequalities for quasi-copulas (Q703390) (← links)
- Prospective control in an enhanced manpower planning model (Q734854) (← links)
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- Finiteness of relative equilibria of the four-body problem (Q818632) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- Numerical solution of special matrix games (Q889170) (← links)
- PANDA: a software for polyhedral transformations (Q904954) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Predictive control for hybrid systems. Implications of polyhedral pre-computations (Q1003540) (← links)
- Converting between quadrilateral and standard solution sets in normal surface theory (Q1035322) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- The word problem in free normal valued lattice-ordered groups: A solution and practical shortcuts (Q1148929) (← 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)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← 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)
- On the occurrence probability of local binary patterns: a theoretical study (Q1932861) (← links)
- Computing the vertices of tropical polyhedra using directed hypergraphs (Q1943657) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Constrained random matching (Q2155237) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Quantum violation of the suppes-zanotti inequalities and ``contextuality'' (Q2239595) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
