Preprocessing DEA
From MaRDI portal
Publication:958453
DOI10.1016/j.cor.2008.01.004zbMath1160.90517OpenAlexW2912461252MaRDI QIDQ958453
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.01.004
Related Items (9)
Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Efficiency evaluation based on data envelopment analysis in the big data context ⋮ Multidimensional frontier visualization based on optimization methods using parallel computations ⋮ Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis ⋮ Competing output-sensitive frame algorithms ⋮ Generalizing cross redundancy in data envelopment analysis ⋮ Data envelopment analysis and big data ⋮ Determining radial efficiency with a large data set by solving small-size linear programs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Measuring the efficiency of decision making units
- Streamlined computation for data envelopment analysis
- A computational study of DEA with massive data sets
- Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
- Efficient algorithm for additive and multiplicative models in data envelopment analysis
- Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
- Output-input ratio analysis and DEA frontier
- Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
- A Special Algorithm for an Additive Model in Data Envelopment Analysis
- Adding and removing an attribute in a DEA model: theory and processing
This page was built for publication: Preprocessing DEA