The following pages link to (Q4518988):
Displaying 47 items.
- On the directed cut cone and polytope (Q281821) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- Polytope volume by descent in the face lattice and applications in social choice (Q823891) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Real-time dynamic programming for Markov decision processes with imprecise probabilities (Q901046) (← links)
- PANDA: a software for polyhedral transformations (Q904954) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Symmetries of the Bell correlation inequalities (Q1409144) (← links)
- The final NETLIB-LP results (Q1417592) (← links)
- Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model (Q1620578) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Polyhedral star-shaped distributions (Q1658067) (← links)
- Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (Q1688454) (← links)
- Simulation of polyhedral convex contoured distributions (Q1690449) (← links)
- Integrated stoichiometric, thermodynamic and kinetic modelling of steady state metabolism (Q1719727) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16 (Q2009162) (← links)
- The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
- Constrained random matching (Q2155237) (← links)
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space (Q2187655) (← links)
- Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
- Computing difference abstractions of linear equation systems (Q2238208) (← links)
- Parity polytopes and binarization (Q2283103) (← links)
- Locally optimal 2-periodic sphere packings (Q2283118) (← links)
- Computations of volumes and Ehrhart series in four candidates elections (Q2288880) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Approximate credal network updating by linear programming with applications to decision making (Q2344362) (← links)
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic (Q2345986) (← links)
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms (Q2353979) (← links)
- Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
- Geometry of possibility measures on finite sets (Q2379302) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Invariant cover: existence, cardinality bounds, and computation (Q2665086) (← links)
- Hepp's bound for Feynman graphs and matroids (Q2693186) (← links)
- A Portable Parallel Implementation of the lrs Vertex Enumeration Code (Q2867140) (← links)
- Optimization with Multivariate Stochastic Dominance Constraints (Q2954390) (← links)
- Optimizing the double description method for normal surface enumeration (Q3584785) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
- Gift-Wrapping Based Preimage Computation Algorithm (Q5458898) (← links)
- On the binary solitaire cone (Q5954234) (← links)
- A pivot-based simulated annealing algorithm to determine oblique splits for decision tree induction (Q6567426) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
