Pages that link to "Item:Q2892275"
From MaRDI portal
The following pages link to Algorithms for the frame of a finitely generated unbounded polyhedron (Q2892275):
Displaying 12 items.
- Competing output-sensitive frame algorithms (Q419370) (← links)
- Improving envelopment in data envelopment analysis under variable returns to scale (Q439477) (← links)
- 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)
- A computational study of DEA with massive data sets (Q941542) (← links)
- Preprocessing DEA (Q958453) (← links)
- Anchor points in DEA (Q1011200) (← links)
- Identifying the anchor points in DEA using sensitivity analysis in linear programming (Q2514838) (← links)
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity (Q4847363) (← links)
- Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis (Q6065665) (← links)
- A general computational framework and a hybrid algorithm for large-scale data envelopment analysis (Q6565403) (← links)