An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
From MaRDI portal
Publication:4427352
Recommendations
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Algorithmic Applications in Management
- scientific article; zbMATH DE number 761263
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- Competing output-sensitive frame algorithms
Cited in
(17)- Generalizing cross redundancy in data envelopment analysis
- The recommender problem with convex hulls
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
- A procedure for large-scale DEA computations
- On characterizing the production possibility set for the CCR ratio model in DEA
- A propositional CONEstrip algorithm
- A general computational framework and a hybrid algorithm for large-scale data envelopment analysis
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
- Data envelopment analysis and big data
- Using lexicographic parametric programming for identifying efficient units in DEA
- A dimensional decomposition approach to identifying efficient units in large-scale DEA models
- Combinatorial redundancy detection
- Algorithmic Applications in Management
- On the properties of positive spanning sets and positive bases
- New algorithm for the conical combination representation problem of a vector
- Algorithms for the frame of a finitely generated unbounded polyhedron
- An algorithm to find the lineality space of the positive hull of a set of vectors
This page was built for publication: An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427352)
