Computational experience with the reverse search vertex enumeration algorithm

DOI10.1080/10556789808805706MaRDI QIDQ4946698zbMATH OpenOpenAlexFDO

Authors David Avis

Publication date 23 March 2000

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556789808805706

zbMATH Keywords

computational experienceconvex hullsreverse searchvertex enumeration

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1629817
• scientific article; zbMATH DE number 1538127
• The Complexity of Vertex Enumeration Methods
• A portable parallel implementation of the \textit{lrs} vertex enumeration code
• How good are convex hull algorithms?

Cited in

(10)

• Estimating the number of vertices of a polyhedron
• New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
• Integrated stoichiometric, thermodynamic and kinetic modelling of steady state metabolism
• Estimating the volume of solution space for satisfiability modulo linear real arithmetic
• scientific article; zbMATH DE number 1629817 (Why is no real title available?)
• A portable parallel implementation of the \textit{lrs} vertex enumeration code
• scientific article; zbMATH DE number 1538127 (Why is no real title available?)
• Approximate vertex enumeration
• HV-symmetric polyhedra and bipolarity
• Property-directed incremental invariant generation

Describes a project that uses

Uses Software

• ZRAM
• lrs

This page was built for publication: Computational experience with 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 Q4946698)