Pages that link to "Item:Q4427352"
From MaRDI portal
The following pages link to An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull (Q4427352):
Displaying 16 items.
- Generalizing cross redundancy in data envelopment analysis (Q635185) (← links)
- An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem (Q827294) (← links)
- Using lexicographic parametric programming for identifying efficient units in DEA (Q868158) (← links)
- A dimensional decomposition approach to identifying efficient units in large-scale DEA models (Q947959) (← links)
- A procedure for large-scale DEA computations (Q1000964) (← links)
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space (Q1268269) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- Data envelopment analysis and big data (Q1755403) (← links)
- On the properties of positive spanning sets and positive bases (Q2357977) (← links)
- Algorithms for the frame of a finitely generated unbounded polyhedron (Q2892275) (← links)
- On characterizing the production possibility set for the CCR ratio model in DEA (Q4862280) (← links)
- Algorithmic Applications in Management (Q5710148) (← links)
- The recommender problem with convex hulls (Q6557743) (← links)
- A general computational framework and a hybrid algorithm for large-scale data envelopment analysis (Q6565403) (← links)
