A revised implementation of the reverse search vertex enumeration algorithm

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)

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

This page was built for publication: A revised implementation of the reverse search vertex enumeration algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518988)