Competing output-sensitive frame algorithms
DOI10.1016/J.COMGEO.2011.12.006zbMATH Open1375.68121OpenAlexW2020322772MaRDI QIDQ419370FDOQ419370
Authors: José H. Dulá, Francisco J. López 
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
Recommendations
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- scientific article; zbMATH DE number 761263
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
- Algorithmic Applications in Management
- scientific article; zbMATH DE number 724218
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Enumerating extreme points in higher dimensions
- Algorithms for the frame of a finitely generated unbounded polyhedron
- An algorithm for data envelopment analysis
- Title not available (Why is that?)
- 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
- 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
Cited In (2)
Uses Software
This page was built for publication: Competing output-sensitive frame algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419370)
