Algorithms for the frame of a finitely generated unbounded polyhedron
From MaRDI portal
Recommendations
- An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
- Algorithmic geometry. Polyhedric and algebraic methods
- scientific article; zbMATH DE number 3904606
- scientific article; zbMATH DE number 1405493
- Polyhedral and algebraic methods in computational geometry
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- scientific article; zbMATH DE number 1961535
- scientific article; zbMATH DE number 4083375
- Algorithms for polytope covering and approximation
- An algorithm for enumeration of polyhedra and orbifolds
Cited in
(14)- Anchor points in DEA
- Identifying the anchor points in DEA using sensitivity analysis in linear programming
- Competing output-sensitive frame algorithms
- Improving envelopment in data envelopment analysis under variable returns to scale
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis
- Generalizing cross redundancy in data envelopment analysis
- A general computational framework and a hybrid algorithm for large-scale data envelopment analysis
- Polyhedra generation from lattice points
- An algorithm to find the lineality space of the positive hull of a set of vectors
- Methods for identifying all extreme points of convex hulls in spaces of dimension greater than 3 revisited
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
- A computational study of DEA with massive data sets
- Preprocessing DEA
This page was built for publication: Algorithms for the frame of a finitely generated unbounded polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892275)
