Competing output-sensitive frame algorithms
From MaRDI portal
Publication:419370
DOI10.1016/j.comgeo.2011.12.006zbMath1375.68121OpenAlexW2020322772MaRDI QIDQ419370
Publication date: 18 May 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.12.006
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Streamlined computation for data envelopment analysis
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
- Using lexicographic parametric programming for identifying efficient units in DEA
- A computational study of DEA with massive data sets
- A dimensional decomposition approach to identifying efficient units in large-scale DEA models
- Preprocessing DEA
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Geometry of optimal value functions with applications to redundancy in linear programming
- Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
- Output-sensitive results on convex hulls, extreme points, and related problems
- Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
- An Algorithm for Data Envelopment Analysis
- A Special Algorithm for an Additive Model in Data Envelopment Analysis
- Adding and removing an attribute in a DEA model: theory and processing
- Preprocessing in Stochastic Programming: The Case of Linear Programs
- Enumerating extreme points in higher dimensions
