Competing output-sensitive frame algorithms

DOI10.1016/J.COMGEO.2011.12.006MaRDI QIDQ419370zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

linear programmingcomputational geometryconvex hullextreme pointsredundancy identification

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

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

Cites work

• scientific article; zbMATH DE number 3133911 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3069629 (Why is no real title available?)
• A Special Algorithm for an Additive Model in Data Envelopment Analysis
• A computational study of DEA with massive data sets
• A dimensional decomposition approach to identifying efficient units in large-scale DEA models
• A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
• Adding and removing an attribute in a DEA model: theory and processing
• Algorithms for the frame of a finitely generated unbounded polyhedron
• An algorithm for data envelopment analysis
• Enumerating extreme points in higher dimensions
• Enumerating extreme points in higher dimensions
• Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
• Geometry of optimal value functions with applications to redundancy in linear programming
• Output-sensitive results on convex hulls, extreme points, and related problems
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Preprocessing DEA
• Preprocessing in Stochastic Programming: The Case of Linear Programs
• Streamlined computation for data envelopment analysis
• Using lexicographic parametric programming for identifying efficient units in DEA

Cited in

(2)

• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Algorithmic Applications in Management

Describes a project that uses

Uses Software

• IMSL Numerical Libraries
• CPLEX
• CGAL

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)