New modification of the double description method for constructing the skeleton of a polyhedral cone
From MaRDI portal
Publication:2901170
Recommendations
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- Two variations of graph test in double description method
- Construction of the convex hull of a finite set of points on the basis of triangulation
- Efficient constraint/generator removal from double description of polyhedra
- A modification of revised simplex method
Cited in
(14)- Double description method revisited
- Dynamic flux balance analysis with nonlinear objective function
- Inner approximation algorithm for solving linear multiobjective optimization problems
- How to find the convex hull of all integer points in a polyhedron?
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square
- Efficient constraint/generator removal from double description of polyhedra
- Design of continuous twisting algorithm
- Two variations of graph test in double description method
- Accelerating Fourier-Motzkin elimination using bit pattern trees
- Efficient elimination of redundancies in polyhedra by raytracing
- PPLite: zero-overhead encoding of NNC polyhedra
- Construction of a smooth Lyapunov function for the robust and exact second-order differentiator
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
- Numerical integration of discontinuous functions in many dimensions
This page was built for publication: New modification of the double description method for constructing the skeleton of a polyhedral cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901170)
