scientific article; zbMATH DE number 1538127
From MaRDI portal
Publication:4518988
Recommendations
- Computational experience with the reverse search vertex enumeration algorithm
- The Complexity of Vertex Enumeration Methods
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Combinatorial face enumeration in convex polytopes
- How good are convex hull algorithms?
Cited in
(51)- Polytope volume by descent in the face lattice and applications in social choice
- scientific article; zbMATH DE number 3986532 (Why is no real title available?)
- Gift-Wrapping Based Preimage Computation Algorithm
- Two variations of graph test in double description method
- Linearly constrained global optimization: a general solution algorithm with applications.
- Computations of volumes and Ehrhart series in four candidates elections
- Convex hulls, oracles, and homology
- Integrated stoichiometric, thermodynamic and kinetic modelling of steady state metabolism
- Polyhedral star-shaped distributions
- Parity polytopes and binarization
- Finding the exact volume of a polyhedron.
- A pivot-based simulated annealing algorithm to determine oblique splits for decision tree induction
- Optimizing the double description method for normal surface enumeration
- On the directed cut cone and polytope
- Faster geometric algorithms via dynamic determinant computation
- Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model
- Locally optimal 2-periodic sphere packings
- Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16
- Polytope-based computation of polynomial ranges
- Invariant cover: existence, cardinality bounds, and computation
- The regularized feasible directions method for nonconvex optimization
- A portable parallel implementation of the \textit{lrs} vertex enumeration code
- Computing difference abstractions of linear equation systems
- Fast Algorithms for Rank-1 Bimatrix Games
- Geometry of possibility measures on finite sets
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Traversing combinatorial 0/1-polytopes via optimization
- Game Theory Explorer: software for the applied game theorist
- Computing monotone disjoint paths on polytopes
- Enumeration of Nash equilibria for two-player games
- Constrained random matching
- The final NETLIB-LP results
- A new algorithm to find all vertices of a polytope
- On the binary solitaire cone
- Computational experience with the reverse search vertex enumeration algorithm
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- PANDA: a software for polyhedral transformations
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space
- Redundant cumulative constraints to compute preemptive bounds
- Simulation of polyhedral convex contoured distributions
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Optimization with multivariate stochastic dominance constraints
- Hepp's bound for Feynman graphs and matroids
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- Thirty years of credal networks: specification, algorithms and complexity
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- Approximate credal network updating by linear programming with applications to decision making
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Computation of invariant sets for complex systems
- Symmetries of the Bell correlation inequalities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518988)
