Efficient constraint/generator removal from double description of polyhedra
From MaRDI portal
(Redirected from Publication:281283)
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) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)
Recommendations
- Efficient elimination of redundancies in polyhedra by raytracing
- On the dynamic problem of computing generators of a polyhedral cone
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- The tropical double description method
- Not necessarily closed convex polyhedra and the double description method
Cites work
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- 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
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Characterizations of adjacency of faces of polyhedra
- Hybrid Systems: Computation and Control
- Inferring sufficient conditions with backward polyhedral under-approximations
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- Not necessarily closed convex polyhedra and the double description method
- Precise widening operators for convex polyhedra
Cited in
(7)- On the efficiency of convex polyhedra
- PPLite: zero-overhead encoding of NNC polyhedra
- Efficient elimination of redundancies in polyhedra by raytracing
- Accelerating Fourier-Motzkin elimination using bit pattern trees
- On the dynamic problem of computing generators of a polyhedral cone
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
This page was built for publication: Efficient constraint/generator removal from double description of polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281283)
