Efficient constraint/generator removal from double description of polyhedra

DOI10.1016/j.entcs.2014.08.002zbMath1337.68262OpenAlexW2092611438WikidataQ113317859 ScholiaQ113317859MaRDI QIDQ281283

Francesca Scozzari, Gianluca Amato, Enea Zaffanella

Publication date: 10 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.08.002

zbMATH Keywords

convex polyhedradouble descriptionincremental computation

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

On the efficiency of convex polyhedra ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees

Uses Software

• PHAVer
• HyTech
• PPL

Cites Work

• Unnamed Item
• Unnamed Item
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Precise widening operators for convex polyhedra
• Not necessarily closed convex polyhedra and the double description method
• New modification of the double description method for constructing the skeleton of a polyhedral cone
• Characterizations of adjacency of faces of polyhedra
• Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Algorithm for discovering the set of all the solutions of a linear programming problem
• Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
• Hybrid Systems: Computation and Control

This page was built for publication: Efficient constraint/generator removal from double description of polyhedra